链表插入排序

算法（升序）：让一个数跟它前面的数字进行比较，直到找到第一个比它小的数字，放在这个数字的后面

/* Definition for singly-linked list. 
    struct ListNode { 
     int val; 
     ListNode *next; 
     ListNode(int x) : val(x), next(NULL) {} 
   }; 
 */
 
 ListNode* insertionSortList(ListNode* head) {
 struct ListNode* cur, *prev, *start, *newH;
 if (head == NULL || head->next==NULL) {
  return head;
 }
 prev = head;
 cur = head->next;
 newH = (struct ListNode*)malloc(sizeof(struct ListNode));
 newH->next = head;
 while (cur) {
  if (cur->val >= prev->val) {
   prev = cur;
   cur = cur->next;
  }
  else {
   //从表头开始找第一个大于cur的结点
   start = newH;
   while (start->next && start->next->val <= cur->val) {
    start = start->next;
   }
   prev->next = cur->next;
   cur->next = start->next;
   start->next = cur;
   //cur指向下一次需要排序的结点位置
   cur = prev->next;
  }
 }
 cur = newH->next;
 free(newH);
 return cur;
}