template <class T>
void quickPartition(T * arry, int len){
T* bigPoint = arry + len - 1;
T tmp;
while(arry < bigPoint){
if(*arry >= *(arry + 1)){
tmp = *arry, *arry = *(arry + 1), *(arry + 1) = tmp;
arry++;
}else{
tmp = *bigPoint, *bigPoint = *(arry + 1), *(arry + 1) = tmp;
bigPoint--;
}
}
}
快速排序一趟分割,单循环
最新推荐文章于 2022-06-19 13:35:15 发布