设计在链式结构上实现简单选择排序算法
typedef int ElemType;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LinkNode;
void paixu(LinkNode *&l){
if(l==0||l->next==0) return;
LinkNode *first,*last,*mid;
int temp;
first=(LinkNode *)malloc(sizeof(LinkNode));
last=(LinkNode *)malloc(sizeof(LinkNode));
mid=(LinkNode *)malloc(sizeof(LinkNode));
first=l;
for(first;first!=0;first=first->next){
last=first->next;
mid=first;
for(last;last!=0;last=last->next){
if(mid->data>last->data){
mid=last;
}
}
if(mid!=first){
temp=mid->data;
mid->data=first->data;
first->data=temp;
}
}
}