searching in c

BINARY SEARCH:

A binary search locates an item in a sorted array by repeatedly dividing the search interval in half. The initial interval includes the entire array. If the value of the search key is less than the item in the middle of the interval, then the next interval will be the lower half of the current interval. If the value of the search key is greater than the middle item, then the next interval will be the upper half. The search process repeats until the item is found or the search interval is empty. Binary Search is an O(log n) algorithm, which is more efficient than a linear search for large arrays

PROGRAM FOR BINARY SEARCH

LINEAR SEARCH:

Linear search, also known as sequential search, is a process that checks every element in the list sequentially until the desired element is found. The computational complexity for linear search is O(n), making it generally much less efficient than binary search (O(log n)). But when list items can be arranged in order from greatest to least and the probabilities appear as geometric distribution (f (x)=(1-p) x-1p, x=1,2), then linear search can have the potential to be notably faster than binary search.

PROGRAM FOR LINEAR SEARCH

Latest posts by admin (see all)

More in sem1
binary search in c

binary search in c A binary search locates an item in a sorted array by repeatedly dividing the search interval...

Close