Insertion Sort List

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode insertionSortList(ListNode head) {
        ListNode curr = head;
        while (curr != null) {
            ListNode temp = head;
            while (temp != curr) {
                if (temp.val > curr.val) {
                    int y = temp.val;
                    temp.val = curr.val;
                    curr.val = y;
                }
                temp = temp.next;
                // System.out.println(curr.val + temp.val);
            }
            
            curr = curr.next;
        }
        return head;
    }
}