//This is about the quick sort. #include<iostream> using namespace std; //--------------------------------- template <typename T> void quicksort(T* a, int m, int n); //快速排序算法 template <typename T> int partition(T* a, int m, int n); //分解操作函数 //--------------------------------- int getlen(char *result){ //本函数只是简单做一个字符数量记录 int i=0; while(result[i]!='\0'){ i++; } //cout<<i<<endl; return i; } //--------------------------------- int main() { //int a[5] = {3,1,5,9,2};//{'3','1','5','9','2','8'}; //quicksort(a,0,4); char a[] = "15928516068"; int g = getlen(a); cout<<"a's length is "<<g<<endl; quicksort(a,0,g-1); for(int i = 0; i<g; i++) cout<<a[i]<<" "; cout<<endl; return 0; } //--------------------------------- template <typename T> int partition(T* a, int m, int n){ //a[m..n]为一个序列 T x = a[m]; //a[m]为选择的杠杆点 int i = m; T temp; for(int j=m+1;j<=n;j++){ if(a[j]<=x){ i = i+1; temp = a[i]; //以下三行交换a[i]和a[j]内容 a[i] = a[j]; a[j] = temp; } } temp = a[i]; a[i] = a[m]; a[m] = temp; return i; } //---------------------------------- template <typename T> void quicksort(T* a, int m,int n){ //递归的调用快速排序算法 if(m<n){ int q = partition(a,m,n); quicksort(a,m,q-1); quicksort(a,q+1,n); } }
//This is about the quick sort.#includeusing namespace std;//---------------------------------template void quicksort(T* a, int m, int n); //快速排序算法template int partition(T* a, int m, int