摘要:
#include#includevoid Quicksort(int array[],int left,int right){int i=left;int j=right;int key=array[i];if(left=key)&&(i<j)){j--;}array[i]=array[j];if((array[i]<=key)&&(i<j)){i++;}array[j]=array[i];}array[i]=key;Quicksort(array,left,i-1);Quicksort(array,j+1,right);}else{retur 阅读全文
posted @ 2014-03-07 15:13
loneliness__白色
阅读(250)
评论(0)
推荐(0)