[c++]快速排序

快速排序：#include<iostream>using namespace std;void quick_sort(int s[],int l,int r){    if(l<r)    {        int i=l;        int j=r;        int x=s[l];        while(i<j)        {            while(i<j&&s[j]>=x)                j--;            if(i<j)                s[i++]=s[j];            while(i<j&&s[i]<x)            i++;            if(i<j)                s[j--]=s[i];        }        s[i]=x;        quick_sort(s,l,i-1);        quick_sort(s,i+1,r);    }}int main(){    int a[]={25,36,56,88,96,45,10,33,02,36,155};    int m;    quick_sort(a,0,sizeof(a)/sizeof(a[0])-1);    for( m=0;m<sizeof(a)/sizeof(a[0]);m++)        cout<<a[m]<<' ';    return 0;}