We can use binary search to reduce the number of comparisons in normal insertion sort. Binary Insertion Sort find use binary search to find the proper location to insert the selected item at each iteration.
In normal insertion, sort it takes O(i) (at ith iteration) in worst case. we can reduce it to O(logi) by using binary search.
Please refer complete article on Binary Insertion Sort for more details!
- Python Program for Binary Insertion Sort
- Java Program for Binary Insertion Sort
- Binary Insertion Sort
- C Program for Insertion Sort
- C Program for Recursive Insertion Sort
- Python Program for Recursive Insertion Sort
- Java Program for Recursive Insertion Sort
- Comparison among Bubble Sort, Selection Sort and Insertion Sort
- Insertion sort to sort even and odd positioned elements in different orders
- Insertion Sort
- Insertion sort using C++ STL
- Recursive Insertion Sort
- Insertion Sort by Swapping Elements
- Time complexity of insertion sort when there are O(n) inversions?
- An Insertion Sort time complexity question