Previous
Next
Reset
Step 1 of 12
Initial k-sorted doubly linked list
k = 2
- Each element is at most 2 positions away from its correct sorted position
Original List
Min-Heap (Window of k+1 elements)
New Sorted List