Clearest Go Solution
Github link\n\n\nfunc insertionSortList(head *ListNode) *ListNode {\n\tdummy := new(ListNode)\n\tfor head != nil {\n\t\tcur := dummy\n\t\tfor ; cur.Next != nil 
[Github link](https://github.com/evleria/leetcode-in-go/blob/main/problems/0147-insertion-sort-list/insertion_sort_list.go)\n\n```\nfunc insertionSortList(head *ListNode) *ListNode {\n\tdummy := new(ListNode)\n\tfor head != nil {\n\t\tcur := dummy\n\t\tfor ; cur.Next != nil && cur.Next.Val < head.Val; cur = cur.Next {\n\t\t}\n\t\tcur.Next, head.Next, head = head, cur.Next, head.Next\n\t}\n\treturn dummy.Next\n}\n```
['Go']