- cut in the middle
- MergeSort(left) and MegerSort(right)
- merge using Merge Two Sorted Lists
fast-slow pointer.
- fast runner goes 2 steps each time
- slow runner goes 1 step
- when fast reach the end of the linked list, the slow id the middle of the list
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
parent directory.. | ||||
fast-slow pointer.