struct node{
int val;
node *left;
node *right;
node(int x):val(x),left(NULL),right(NULL){}
};
void sortnum(int start,int end,int *num)
{
int left=start,right=end;
int pri=num[start];
if(start>=end) return;
while(left<right)
{
while(left<right&&num[left]<pri) left++;
while(left<right&&num[right]>pri) right--;
int tmp = num[left];
num[left] =num[right];
num[right] =tmp;
}
int tmp = num[left];
num[left] =num[right];
num[right] =tmp;
sortnum(start,left-1,num);
sortnum(left+1,end,num);
}
快排和节点定义
最新推荐文章于 2024-07-13 23:05:26 发布