| <<< Insertion Sort Complexity | Index | Binary Search Algorithm Example >>> |
Search item is compared with middle element of list
If search item < middle element of list, search is restricted to first half of the list
If search item > middle element of list, search second half of the list
If search item = middle element, search is complete
| <<< Insertion Sort Complexity | Index | Binary Search Algorithm Example >>> |