链表排序--选择排序

void sort_list(node *head)
{
node *p, *q, *s;
int t;
p = head;
while(p)
{
s = p;
q = p->next;
while(q)
{
if (q->value < s->value)
s = q;
q = q->next;
}
if (s !=p)
{
t = s->value;
s->value = p->value;
p->value = t;
}
p = p->next;
}
}