C语言链表的创建与排序

　2008-03-08 21:56:20　来源：WEB开发网　闂傚倷绶氬ḿ褍螞閹绢喖绠柨鐕傛嫹

闂傚倷绀侀幉锟犲垂閻㈠灚宕查柟鎵閸庡秵銇勯幒鎴濃偓鐢稿磻閹炬枼妲堟繛鍡楃С濞岊亞绱撻崒姘扁枌闁瑰嚖鎷�

婵犵數濮幏鍐川椤撴繄鎹曢梻渚€娼уú銈吤洪妸鈺佺劦妞ゆ帊鑳堕埊鏇㈡煏閸モ晛浠х紒杈╁仱閺佹捇鏁撻敓锟�闂傚倷绶氬ḿ褍螞閹绢喖绠柨鐕傛嫹　　闂傚倷鑳舵灙缂佺粯顨呴埢宥夊即閵忕姵鐎梺缁樺姇閹碱偆鐥閺屾洘绻濊箛鏇犵獥闂佺厧澹婃禍婊堚€旈崘顏佸亾閿濆骸澧ù鐘欏嫮绠鹃柛顐ゅ枎閻忋儲銇勯弴妯哄姦妞ゃ垺鐟╅幃鈩冩償閵囧府鎷�

核心提示：include<stdio.h> #include<stdlib.h> typedef strUCt STRUCT { int value; struct STRUCT *next; }TS; main() { #define N 9 int a[N],i; TS *head,*p; TS *C

　　include<stdio.h>
#include<stdlib.h>
typedef strUCt STRUCT {
int value;
struct STRUCT *next;
}TS;
main()
{
#define N 9
int a[N],i;
TS *head,*p;
TS *CreateLink(int *,int);
void sort(TS **);
randomize();
for(i=0;i a=random(9);
head=CreateLink(a,N);
for(p=head;p;p=p->next)
PRintf("%-2d",p->value);
putchar('\n');
sort(&head);
for(p=head;p;p=p->next)
printf("%-2d",p->value);
getchar();
}
void sort(TS **h) /* 选择排序算法 */
{
TS *h1,*p,*q,*r,*s;
h1=p=(TS *)malloc(sizeof(TS));
p->next=*h;
while(p->next) {
q=p->next;
r=p;
while(q->next) {
if(q->next->valuenext->value)
r=q;
q=q->next;
}
if(r!=p) {
s=r->next;
r->next=s->next;
s->next=p->next;
p->next=s;
}
p=p->next;
}
*h=h1->next;
free(h1);
}
TS *CreateLink(int *a,int n)
{
int i;
TS *h,*p;
h=NULL;
for(i=n;i>0;i--) {
p=(TS *)malloc(sizeof(TS));
p->value=a[i-1];
p->next=h;
h=p;
}
return h;
}