#include<stdio.h>
#include<stdlib.h>
typedef struct{
int key;
int info;
}recordNode;
typedef struct {
int MAXNUM;
int n;
recordNode * record;
}sortobject,* PSeqList;
void quicksort(sortobject * pvector,int l,int r);
PSeqList Putinto();
void quicksort(sortobject * pvector,int l,int r){
int i,j,k;
recordNode temp;
if(l>r)return;
i=l;j=r;temp=pvector->record[i];
while(i!=j){
while((j>i)&&(pvector->record[j].key>=temp.key))j--;
if(i<j) pvector->record[i++]=pvector->record[j];
while((j>i)&&(pvector->record[i].key<=temp.key))i++;
if(i<j)pvector->record[j--]=pvector->record[i];
}
pvector->record[i]=temp;
quicksort(pvector,l,i-1);
本内容试读结束,登录后可阅读更多
下载后可阅读完整内容,剩余2页未读,立即下载