A REVIEW ON COMPARISION OF BINARY SEARCH AND LINEAR SEARCH

After the years of research done by scientists, it is found that binary search is more efficient than the linear search .Earlier, the sorting time of linear search before the application of binary se arch appeared not to have been considered. In Linear search algorithm searching begins with searching every element of the list till the required record is found and if the list is quite huge, then this approach is not optimal. The drawbacks of sequential search can be eliminated by using Binary search algorithm. This paper analyzes both the algorithms at some extent for the applicability and execution efficiency