各种排序，待添加

#include <iostream>
#include <ctime>//取随机数用时间做种
#include <cstdlib>
#include <time.h>//计算用时
#include <algorithm>
#include <stdio.h>//输出文件用
#include <iomanip>//
using namespace std;
int NUM = 100;       //要排序的数目
int NUM_PER_LINE = 7;//每行输出多少个数
void insertion_sort(int *,int ,int);
void quickSort(int *p ,int start,int end);
void bobbleSort(int *p ,int start,int end);
void selectSort(int *p ,int start ,int end);
int * makeRandom();//产生随机数组
void printUseTime(int*,int ,int ,int);//打印用的时间
void print(int *);//打印原数组
void importNUM();//输入要排序的个数
void chooseMode();//选择要用哪种排序
int main()
{
    importNUM();             //输入要排序的个数
    chooseMode();            //选择要用哪种排序
    return 0;
} 
//插入排序
void insertion_sort(int *p,int start,int end)
{
    int temp;
    int i,j;
    for (i =start+1; i < end; i++)
    {
        j = i-1;
        temp = p[i];
        while ( j >=start && p[j] > temp)
        {
            p[j+1] = p[j];
            j--;
        }
         p[j+1] = temp;
    }
}
//快速排序
void quickSort(int *p ,int start,int end)
{
    int i = start , j = end;
    int base = p[i];//选取第一个作为基数
    int dig = i;//挖的坑
    while( i!= j)
     {
         while (p[j] >= base && j > i)
         {
             j--;
         }
         p[dig] = p[j];
         dig = j;
         while (p[i] <= base && j> i)
         {
             i++;
         }
         p[dig] = p[i];
         dig = i;
    }
    p[dig] = base;
    if(start < dig-1)
        quickSort(p,start,dig-1);
    if(dig+1 < end)
        quickSort(p,dig+1,end);
}
 //冒泡排序
void bobbleSort(int *p ,int start,int end)
{
    int temp;
    for (int i = start;  i < end-1 ;i++)
        for (int j =start; j < end -i-1 ;j++)
        {
            if (p[j] > p[j+1])
            {
                temp = p[j];
                p[j] = p[j+1];
                p[j+1] = temp;
            }
        }
}
//选择排序
void selectSort(int *p ,int start ,int end)
{
    for (int i =start; i < end -1 ;i++)
    {
        int min = i+1,temp;
        for (int j = i+1 ; j < end;j++)
        {
            if(p[min] > p[j])
            {
                min = j;
            }
        }
        if (p[min] < p[i])
        {
            temp = p[i];
            p[i] = p[min];
            p[min] = temp;
        }
    }
}
void print(int *p)
{
    int numPerLine = NUM_PER_LINE;
    for (int i = 0; i < NUM ;i++)
    {
        cout<<" "<<setw(8)<<p[i];
        if(--numPerLine == 0)
        {
            cout<<endl;
            numPerLine += NUM_PER_LINE;
        }     
    }
}
int * makeRandom()
{
    srand(unsigned(time(0)));//做种子
     int *p = new int[NUM];
    for (int i = 0; i < NUM; i++)
     {
         p[i] = (int)rand();
    }
    return p;
}
void printUseTime(int*p,int start ,int end ,int mode)
{
    int *v = new int[NUM];
    for (int i = 0; i < NUM; i++)
        v[i] = p[i];
    switch (mode)
    {
        case 0:
        {
            double formerTime = clock();
            insertion_sort(v,start,end);
            cout<<"插入排序共用时"<<clock() - formerTime<<"毫秒\n";
            break;
        }
        case 1:
        {
            double formerTime = clock();
            quickSort(v,start,end);
            cout<<"快速排序共用时"<<clock() - formerTime<<"毫秒\n";
            break;
        }
        case 2:
        {
            double formerTime = clock();
            bobbleSort(v,start,end);
            cout<<"冒泡排序共用时"<<clock() - formerTime<<"毫秒\n";
            break;
        }
        case 3:
        {
            double formerTime = clock();
            selectSort(v,start,end);
            cout<<"选择排序共用时"<<clock() - formerTime<<"毫秒\n";
        }
    default:
        break;
    }
//delete [] v;
}
void importNUM()
{
    cout<<"请输入要排序的个数\n";
    cin>>NUM;
}
void chooseMode()//选择要用哪种排序
{
    int * p = makeRandom();//产生随机数组
    int switch_on;
    cout<<"请输入要选择哪种排序？\n";
    cout<<"0.插入排序\n";
    cout<<"1.快速排序\n";
    cout<<"2.冒泡排序\n";
    cout<<"3.选择排序\n";
    cout<<"4.全都排一遍\n";
    cin>>switch_on;
    if(switch_on == 4)
        for (int i = 0 ;i < 4; i++)
            printUseTime(p,0,NUM,i);
    else
        printUseTime(p,0,NUM,switch_on);
    delete []p;
}