IS BINARY SEARCH TECHNIQUE FASTER THAN LINEAR SEARCH TECHNIQUE?

Over the years, computer scientists have conducted researches on linear and binary search algorithms, and concluded that binary search algorithm is faster than linear search algorithm. Although it was a good observation yet, the sorting time before the application of binary search appeared not to have been considered. This paper critically tries to conduct experiments on the execution time of linear search, binary search without inclusion of sorting time, and binary search with the inclusion the sorting time