 Time Flying  ### Insertion_Sort_List

Sort a linked list using insertion sort. A graphical example of insertion sort. The partial sorted list (black) initially contains only the first element in the list. With each iteration one element (red) is removed from the input data and inserted in-place into the sorted list.

Algorithm of Insertion Sort:

1. Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list.
2. At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there.
3. It repeats until no input elements remain.

Example 1:

``````Input: 4->2->1->3
Output: 1->2->3->4``````

Example 2:

``````Input: -1->5->3->4->0
Output: -1->0->3->4->5``````

### Analyze

``````       head0
dummy -> 4 -> 2 -> 1 -> 3
.
.
dummy -> 4 -> 2 -> 1 -> 3
.
.
dummy -> 2 -> 4 -> 1 -> 3
.
.
dummy -> 1 -> 2 -> 4 -> 3
.
.
dummy -> 1 -> 2 -> 3 -> 4``````
``````        head0
dummy -> -1 -> 5 -> 3 -> 4 -> 0
.
.
dummy -> -1 -> 5 -> 3 -> 4 -> 0
.
.
dummy -> -1 -> 3 -> 5 -> 4 -> 0
.
.
dummy -> -1 -> 3 -> 5 -> 4 -> 0
.
.
dummy -> -1 -> 3 -> 4 -> 5 -> 0
.
.
dummy -> -1 -> 0 -> 3 -> 4 -> 5``````
``````/**
* function ListNode(val) {
*     this.val = val;
*     this.next = null;
* }
*/
/**
* @return {ListNode}
*/
const dummy = new ListNode(0)

continue
}

let pre = dummy
while (pre.next.val < head0.next.val) { pre = pre.next } 