Merge K Sorted Linkedlist Algorithm

O(n).The algorithm first movements the first component of a list into a sub-list. This algorithm is named strand sort because there are strands of sorted components within the unsorted components that are removed one at a time.

Merge K Sorted Linkedlist source code, pseudocode and analysis