C++ || Insertion Sort || An Easy and Clear Way to Sort ✔
class Solution {\npublic:\n    ListNode insertionSortList(ListNode head) {\n        \n        if(head == nullptr) return nullptr;\n        \n        int temp = 
class Solution {\npublic:\n    ListNode* insertionSortList(ListNode* head) {\n        \n        if(head == nullptr) return nullptr;\n        \n        int temp = 0;\n        for(ListNode* curr = head; curr != nullptr; curr = curr->next){\n            for(ListNode* prev = head; prev != curr; prev = prev->next){\n                if(curr->val < prev->val){\n                    temp = curr->val;\n                    curr->val = prev->val;\n                    prev->val = temp;\n                }\n            }\n        }\n        return head;\n    }\n};
['Linked List', 'C']