摘要:
int div(double *start,double *end) { double *privot,*p,*q,t; p=start; q=end-1; privot=start; if(start==end) return 0; while(p*privot) { t=*p; *p=*privot; *privot=t; privot=p; q--; break; } p++; } } div(start,privot); div(privot+1,end);}快速排序 题目:为数... 阅读全文