二进制插入排序的C程序

我们可以使用二进制搜索来减少普通插入排序中的比较次数。二进制插入排序查找使用二进制搜索来找到正确的位置，以便在每次迭代时插入选定的项。
在普通插入中，排序在最坏的情况下需要O(i)(在第i次迭代中)。我们可以使用二进制搜索将其简化为O(logi)。

C/C++

// C program for implementation of binary insertion sort
#include 
  
// A binary search based function to find the position
// where item should be inserted in a[low..high]
int binarySearch(int a[], int item, int low, int high)
{
    if (high <= low)
        return (item > a[low])?  (low + 1): low;
  
    int mid = (low + high)/2;
  
    if(item == a[mid])
        return mid+1;
  
    if(item > a[mid])
        return binarySearch(a, item, mid+1, high);
    return binarySearch(a, item, low, mid-1);
}
  
// Function to sort an array a[] of size \'n\'
void insertionSort(int a[], int n)
{
    int i, loc, j, k, selected;
  
    for (i = 1; i < n; ++i)
    {
        j = i - 1;
        selected = a[i];
  
        // find location where selected sould be inseretd
        loc = binarySearch(a, selected, 0, j);
  
        // Move all elements after location to create space
        while (j >= loc)
        {
            a[j+1] = a[j];
            j--;
        }
        a[j+1] = selected;
    }
}
  
// Driver program to test above function
int main()
{
    int a[] = {37, 23, 0, 17, 12, 72, 31,
              46, 100, 88, 54};
    int n = sizeof(a)/sizeof(a[0]), i;
  
    insertionSort(a, n);
  
    printf("Sorted array: \n");
    for (i = 0; i < n; i++)
        printf("%d ",a[i]);
  
    return 0;
}
Please refer complete article on Binary Insertion Sort for more details!Want to learn from the best curated videos and practice problems, check out the C Foundation Course for Basic to Advanced C.