插入排序，归并排序，快速排序时间效率测试

随机产生100000个数据，分别用三种算法测试排序的时间，机器和代码都略渣。。。

/*
插入排序、归并排序、快速排序时间测试
*/
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <limits.h>

#define N 100000

int n[N];

//随机数产生
void getRandomNum()
{
    srand(time(0));
    for(int i=0; i<N; i++)
    {
        n[i] = rand()%INT_MAX;
    }
}

//插入排序
void insertSort()
{
    int target, point;
    for(int i=1; i<N; i++)
    {
        target = n[i];
        //二分查找节点
        int st=0, ed=i, t;
        while(st != ed)
        {
            if(target == n[(st+ed)/2])
            {
                t = (st+ed)/2;
                break;
            }
            else if(target < n[(st+ed)/2])
            {
                ed = (st+ed)/2;
            }
            else
            {
                st = (st+ed)/2+1;
            }
        }
        t = st==ed?st:t;

        for(int j=i; j>t; j--)
        {
            n[j] = n[j-1];
        }
        n[t] = target;
    }
}

//归并排序
void merge(int st, int ed)
{
    int ps = st, pe = (st+ed)/2+1, i;
    int num[ed-st+1];
    for(i=0; i<=(ed-st); i++)
    {
        if(ps==(st+ed)/2+1 || pe==(ed+1)) break;
        num[i] = n[ps]<n[pe]?n[ps++]:n[pe++];
    }
    if(ps==(st+ed)/2+1)
    {
        for(; i<=(ed-st); i++)
        {
            num[i] = n[pe++];
        }
    }
    if(pe==(ed+1))
    {
        for(; i<=(ed-st); i++)
        {
            num[i] = n[ps++];
        }
    }
    int k=0;
    for(int i=st; i<=ed; i++,k++)
    {
        n[i] = num[k];
    }
}

void mergeSort(int start, int end)
{
    if(start == end) return;

    mergeSort(start, (start+end)/2);
    mergeSort((start+end)/2+1, end);
    merge(start, end);
}

//快速排序
void swap(int i, int j)
{
    int t = n[i];
    n[i] = n[j];
    n[j] = t;
}

int sort(int st, int ed)
{
    int pivot = n[st];
    int p = st;

    for(int i=st+1, j=ed; i<=j;)
    {
        if(pivot > n[i])
        {
            swap(i, p);
            p = i++;
            continue;
        }
        if(pivot <= n[i]) swap(j--, i);
    }
    return p;
}

void quickSort(int start, int end)
{
    if(start >= end) return;

    int p = sort(start, end);

    quickSort(start, p);
    quickSort(p+1, end);
}

void testTime()
{
    int time_start, time_end;

    getRandomNum();
    time_start = clock();
    insertSort();
    time_end = clock();
    printf("插入排序用时：%d ms\n", time_end-time_start);

    getRandomNum();
    time_start = clock();
    mergeSort(0, N-1);
    time_end = clock();
    printf("归并排序用时：%d ms\n", time_end-time_start);

    getRandomNum();
    time_start = clock();
    quickSort(0, N-1);
    time_end = clock();
    printf("快速排序用时：%d ms\n", time_end-time_start);
}

int main()
{
    testTime();
    return 0;
}