学步园

#include<iostream><br /> using namespace std;<br /> inline void swap(int &x,int &y){<br /> int tmp = x;<br /> x=y;<br /> y=tmp;<br /> }<br /> int partition(int *a,int p,int r){<br /> int x=a[r-1];<br /> int i=p-1;<br /> for(int j=p;j<r-1;++j){<br /> if(a[j]<=x) {<br /> ++i;<br /> swap(a[i],a[j]);<br /> }<br /> }<br /> swap(a[++i],a[r-1]);<br /> return i;<br /> }<br /> void quicksort(int *a,int p,int r){<br /> int q=0;<br /> if(p<r){<br /> q=partition(a,p,r);<br /> quicksort(a,p,q-1);<br /> quicksort(a,p+1,r);<br /> }<br /> }<br /> int main(){<br /> int a[]={11,2,789,0,282,22,78,29};<br /> int size=sizeof(a)/sizeof(*a);<br /> cout<<"排序前：";<br /> for(int i=0;i<size;++i){<br /> cout<<a[i]<<" ";<br /> }<br /> cout<<endl;<br /> quicksort(a,0,size);<br /> cout<<"排序后： ";<br /> for(int i=0;i<size;++i){<br /> cout<<a[i]<<" ";<br /> }<br /> cout<<endl;<br /> system("pause");<br /> }