單向鏈表的冒泡排序

void popsortList(NODE *pHead) { int len = strlenList(pHead); NODE *temp; for(int i = 0; i<len-1; i++) { NODE *t = pHead; NODE *p = t->next; NODE *q = p->next;

>>阅读原文<<