#include<iostream>
#include"stdlib.h"
#define random(x) (rand()%x)
using namespace std;
int count1=0,count2=0;
int comp(int a,int b){
count1++;
if(a<=b) return 1;
else return 0;
}
void swap(int a,int b){
int t;
t=a;
a=b;
b=t;
count2++;
}
int split(int aa[],int low,int high){
int k,i=low;
int x=aa[low];
for(k=low+1;k<=high;k++){
i=i+1;
if(i!=k)
swap(aa[i],aa[k]);
}
swap(aa[low],aa[i]);
return i;
}
void quick_sort(int A[],int low,int high){
int k;
if(low<high){
k=split(A,low,high);
quick_sort(A,low,k-1);
quick_sort(A,k+1,high);
}
}
int main(){
int n;
cout<<"输入排序元素个数n=";
cin>>n;
cout<<endl<<"产生"<<n<<"个0-100之间的随机整数为:";
int * A=new int[n];
for(int i=0;i<n;i++){
A[i]=random(101);
cout<<A[i]<<" "
分治法排序——C++实现
最新推荐文章于 2021-12-15 14:09:44 发布