双向循环链表的排序

//排序 void sort(dlist_t head) { dlist_t tmp = head->next,p = NULL,q = NULL; //将链表置空 head->next = head; head->prev = head; while(tmp!=head){ //保存原链表中tmp的下一个节点 q = t

>>阅读原文<<