List 的选择排序

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *insertionSortList(ListNode *head) {
        if(head == NULL ){
            return NULL;
        }
        if(head->next == NULL){
            return head;
        }
        
        ListNode dump (0);
        dump.next=head;
        ListNode *c_ptr = &dump;//指向了要插入的地方
        ListNode *tmp = c_ptr->next;
        ListNode *min_ptr =  c_ptr->next;    
        ListNode *pre_ptr = c_ptr;
        while ( c_ptr->next != NULL ){//最后一个元素是不用判断的
            tmp = c_ptr;
            pre_ptr = c_ptr;
            min_ptr = c_ptr->next;
            bool flag = false;
            while(tmp->next!= NULL){                
                if(min_ptr->val > tmp->next->val ){
                    min_ptr = tmp->next;           
                    pre_ptr = tmp;
                    flag = true;
                }
                tmp = tmp->next;
            }
            //将min指向的node节点放到c_ptr 的后面
            if (flag) {//这里要保证ptr_ptr->next != NULL 不然就会段错误，注意
                pre_ptr->next = pre_ptr->next->next;
            	min_ptr->next = c_ptr->next;
            	c_ptr->next = min_ptr;
            }
           
            c_ptr = c_ptr->next;
            
        }
        return dump.next;
    }
};