08/06/25 01:06:35
>>629
void quicksort(int left, int right)
{
int i=0;
if(left >= right) return;
i = partition(left, right);
quicksort(left, i-1);
quicksort(i+1, right);
}
void mergesort(int l, int r)
{
int m;
if(l>=r) return;
m = (l + r) / 2;
mergesort(l, m);
mergesort(m+1, r);
merge(l, m, r);
}