摘要： NODE *list;//list->value, list->next;NODE *A = list;NODE *B;if(A==pHead){ if(A->value>B->value) { A->next=B->next; B->next=A; A=B;//好像错误A0->next=B A0=B; B=A->next; } A0=A; A=B; B=A->next;}else{ NODE *A0 = Head; for(A=Head;A->next != NULL;A=A->next) { for(B= A-& 阅读全文