[C++]几种排序

本文为大大维原创，最早于博客园发表，转载请注明出处！！！

1.冒泡：

#include<cmath>
#include<cstdlib>
#include<ctime>
#include<iostream>
using namespace std;
int main()
{
    int n;
    cout<<"INPUT NUM"<<endl;
    cin>>n;
    const int cn=n;
    int num[cn],
        srand(static_cast<unsigned>(time(NULL)));
    for(auto &s:num)
    {
        s=rand()%;
    }
    for(auto s:num)
        cout<<s<<" ";
    cout<<endl;
    for(int i=; i<cn; i++)
    {
        for(int j=; j<cn-i; j++)
        {
            if(num[j]>num[j+])
            {
                int temp=num[j];
                num[j]=num[j+];
                num[j+]=temp;
            }
        }
    }
    for(auto s:num)
        cout<<s<<" ";
    cout<<endl;
    return ;
}

2.快速

  #include<iostream>
  #include<cstdlib>
  #include<ctime>
  using namespace std;
  /*
 6 @快序排列算法的实现
 7 */
  int partition(int data[],int m,int p)///返回p，使得data[p]是第p小的值
  {
     int i=m,j=data[i];///j是划分元素
     bool flag=true;
     while(flag)
     {
         do
             i++;
         while(data[i]<j);
         do
             p--;
         while(data[p]>j);
         if(i<p)
         {
             int temp;
             temp=data[i];
             data[i]=data[p];
             data[p]=temp;
         }
         else
             flag=false;
     }
     data[m]=data[p];
     data[p]=j;
     return p;
 }
 void quicksort(int data[],int low,int high)
 {
     if(low<high)
     {
         int temp=high+;
         temp=partition(data,low,temp);
         quicksort(data,low,temp-);
         quicksort(data,temp+,high);
     }
 }
 int main()
 {
 /*
47 @产生一个规模为CNT的,范围为[RANDMIN，RANDMAX）的随机数组,并显示
48 */
     int cnt,randmin,randmax;
     cout<<"Please Input 'CNT' 'RANDMIN' 'RANDMAX'"<<endl;
     cin>>cnt>>randmin>>randmax;
     const int CNT=cnt,
               RANDMIN=randmin,
               RANDMAX=randmax;
     int Data[CNT];
     srand((unsigned)time(NULL));
     for(int i=; i<CNT; i++)
         Data[i]=RANDMIN+rand()%(RANDMAX-RANDMIN);
     cout<<"Before Change,Data="<<endl;
     for(int i=; i<CNT; i++)
         cout<<Data[i]<<"    ";
     cout<<endl;
 /*
64 @将数组用快速排序算法排序,并显示
65 */
     quicksort(Data,,CNT-);
     cout<<"After Change,Data="<<endl;
     for(int i=; i<CNT; i++)
         cout<<Data[i]<<"    ";
     cout<<endl;
     return ;
 }