If the elements of an array are already sorted then the useful search algorithm is,
►Linear search ►Binary search ►Quick search ►Random search In binary search algorithm, the ‘divide and conquer’ strategy is applied. This plies only to sorted arrays in ascending or descending order.
No comments:
Post a Comment