What is the easiest searching method to use?

Just as qsort() was the easiest sorting method, because it is part of the standard library, bsearch() is the easiest searching method to use. If the given array is in the sorted order bsearch() is the best method. Following is the prototype for bsearch(): void *bsearch(const void *key, const void *buf, size_t num, size_t size, int (*comp)(const void *, const void*)); Another simple searching method is a linear search. A linear search is not as fast as bsearch() for searching among a large number of items, but it is adequate for many purposes. A linear search might be the only method available, if the data isn�t sorted or can�t be accessed randomly. A linear search starts at the beginning and sequentially compares the key to each element in the data set.

Interview Candidate
Mar 6th, 2005
1
2561

Answer

Showing Answers 1 - 1 of 1 Answers

Manan Jadhav
Profile Answers by Manan Jadhav

May 4th, 2011

binary search is the most easiest and efficient search algorithm to use....
pseudocode is:(this one is the recursive approach):

BinarySearch(A[0..N-1], value, low, high)
{ if (high < low) return -1 // not found
mid = low + (high - low) / 2
if (A[mid] > value)
return BinarySearch(A, value, low, mid-1)
else if (A[mid] < value)
return BinarySearch(A, value, mid+1, high)
else
return mid // found }