快速排序

#include <bits/stdc++.h>using namespace std;void Qsort(int num[],int start,int end){    if(start>=end)return;    int temp=num[start];    int i=start,j=end;    while(i<j)    {        while(i<j&&temp<=num[j])--j;//“<=”等号千万别忘        num[i]=num[j];        while(i<j&&num[i]<=temp)++i;//“>=”等号千万别忘        num[j]=num[i];    }    num[i]=temp;    Qsort(num,start,i-1);    Qsort(num,i+1,end);}int main(){    int a[5]={0,4,4,5,1};    Qsort(a,0,4);    for(int i=0;i<5;i++)        cout<<a[i]<<endl;    return 0;}