Binary Insertion Sort

Binary Insertion Sort is a variation of Insertion Sort that uses binary search to find the correct position to insert the current element, reducing the number of comparisons but still requiring shifting of elements.