LeetCode
LeetCode copied to clipboard
递归结束条件不简洁
void quick_sort(int a[],int first,int last)
{
if(first<last)
{
int povit = once_partition(a,first,last);
quick_sort(a,0,povit-1);
quick_sort(a,povit+1,last);
}
}
改为 void quick_sort(int a[],int first,int last) { if(first>=last) return; int povit = once_partition(a,first,last); quick_sort(a,0,povit-1); quick_sort(a,povit+1,last); }