147

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* insertionSortList(ListNode* head) {
        ListNode *dummy = new ListNode(0, head);
        ListNode *element, *prev, *curr;
        prev = dummy; element = dummy->next;
        while(element){
            curr = dummy;
            while(curr->next != element){
                if(curr->next->val > element->val){
                    prev->next = element->next;
                    element->next = curr->next;
                    curr->next = element;
                    element = prev->next;
                    break;
                }
                else{
                    curr = curr->next;
                }
            }
            if(curr->next == element){
                prev = element;
                element = element->next;
            }
        }
        return dummy->next;
    }
};