void sort(Lnode *head) { Lnode *p, *q, *t; p = head -> next; while(p) { Lnode *min = p; q = min -> next;   ...