链表排序（LeetCode Sort List）.docVIP

链表排序（LeetCode Sort List） Function: select the sort (ascending) Returns: pointer to the list header ========================== * / * The basic idea of ranking is repeated from those nodes are not sorted in, Select the key (it is used to sort the field, we take the number num for the minimum node key), In order to form a linked list. I think the list to write this kind of program, the key is to understand: Head storage is the first node address, head-next storage is second nodes; Any node of the address of the P can only be obtained through it before a node next. One-way linked list selection icon: ----[1]----[3]----[2] ----[n]----[NULL] (the original list)... Head 1-next 3-next 2-next n-next ----[NULL] (empty list) First Tail ----[1]----[2]----[3]... ----[n]----[NULL] (ranking list) First 1-next 2-next 3-next tail-next Figure 10: N node list selection sort 1, first find the smallest in the original list, find one put it into another empty list; In the first place, the 2 node empty list, generates an ordered list, and make it separate in the original list (out of the original this time to pay attention in the list is the first node or other intermediate nodes); 3, to find a minimum in the original list, found after put it into an ordered list of the tail pointer next, then it turned into the tail pointer; * / Struct student *SelectSort (struct student *head) { Struct student *first; / * * / header pointer ordered chain arrangement The struct student *tail table; the tail pointer * / / * ordered chain arrangement Struct student *p_min; / * reserved precursor node key smaller the pointer. Struct student *min; / * * / minimum storage node Struct student *p; / * compared to the current node First = NULL; While (head! = NULL) / * find minimum node keys in the list. * / { Note: here is the for statement should reflect selection sort of ideas. For (p=head, min=head; p-next =NULL p=p-next; / *!) node traversing the list in circulation, find the minimum node. * / { If (p-next-