[数据结构与算法]单链表排序

 //冒泡排序 节点值交换法
 void Sort(List *head) {
     List *p, *q;
     for (p = head->pNext; p != NULL; p = p->pNext)
         for (q = p->pNext; q != NULL; q = q->pNext)
             if (p->number > q->number)//根据学号从小到大排序
             {
                 int t1 = p->number; p->number = q->number; q->number = t1;
                 int t2 = p->score; p->score = q->score; q->score = t2;
             }
         }