排序算法

#include <iostream.h>

void InsertSort(int arr[], int len)
{
    for (int i=1; i<len; i++)
    {
        int temp = arr[i];
        for (int j=i-1; j>=0 && temp<arr[j]; j--)
        {
            arr[j+1] = arr[j];
        }
        arr[j+1] = temp;
    }
}

void BInsertSort(int arr[], int len)
{
    for (int i=1; i<len; i++)
    {
        int temp = arr[i];
        int low = 0;
        int high = i - 1;

        while (low <= high)
        {
            int mid = (low + high) / 2;
            if (temp < arr[mid])
            {
                high = mid - 1;
            }
            else
            {
                low = mid + 1;
            }
        }

        for (int j=i-1; j>=high+1; j--)
        {
            arr[j+1] = arr[j];
        }

        arr[high+1] = temp;
    }
}

void SelectSort(int arr[], int len)
{
    for (int i=0; i<len-1; i++)
    {
        int min = i;
        for (int j=i+1; j<len; j++)
        {
            if (arr[j] < arr[min])
            {
                min = j;
            }
        }
        int temp = arr[i];
        arr[i] = arr[min];
        arr[min] = temp;
    }
}

void BubbleSort(int arr[], int len)
{
    for (int i=len-1; i>0; i--)
    {
        bool exchanged = false;
        for (int j=0; j<i; j++)
        {
            if (arr[j] > arr[j+1])
            {
                int temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
                exchanged = true;
            }
        }
        if (!exchanged)
        {
            return;
        }
    }
}

void QuickSort(int arr[], int low, int high)
{
    if (low >= high)
    {
        return;
    }

    int i = low;
    int j = high;
   
   
    int pivot = arr[i];
    while (i<j)
    {
        while (j>i && arr[j]>=pivot)
        {
            j--;
        }
        arr[i] = arr[j];

        while (i<j && arr[i]<=pivot)
        {
            i++;
        }
        arr[j] = arr[i];
    }
    arr[i] = pivot;
    QuickSort(arr, low, j - 1);
    QuickSort(arr, i + 1, high);   
}

void main()
{
    int arr[] = {49,38,65,97,76,13,27,49};
    int len = sizeof(arr) / sizeof(arr[0]);
//    InsertSort(arr, len);
//    BInsertSort(arr, len);
//    SelectSort(arr, len);
//    BubbleSort(arr, len);
    QuickSort(arr, 0, len-1);

    for (int i=0; i<len; i++)
    {
        cout<<arr[i]<<'/t';
    }
    cout<<endl;
}