Binary Insertion Sort

Binary Insertion sort algorithm is a sorting algorithm where the binary search algorithm is used to reduce the number of comparisons in Insertion sort.

The average case time complexity is O(N log N) and the auxiliary space complexity is O(1).

Refer the article for more details and implementations.

Share your thoughts or ask any questions below.
This is a companion discussion topic for the original entry at