Basic algorithms: searching, sorting
Programming Fundamentals · Engineering
Study notes
Binary search for 7 in [1,3,5,7,9,11]: mid index 2 (value 5) < 7, search right half [7,9,11]; mid is 9 > 7, search [7]; found at index 3. Only 3 comparisons vs 4 for linear search; on a million items it is 20 vs 1,000,000.