algorithm - Using mergesort for list -

algorithm - Using mergesort for list -

mergesort can done in-place list;unlike array. however,i have not found reference yet explains how achieved. pointer appreciated.

it possible, though not straightforward, implement in-place merge sort arrays. linked lists problem becomes quite simple. each node in linked list has value , pointer next node. quite simple break linked list in half. traverse middle node, take successor head of sec list , set successor null.

the merge step works expect. don't create new nodes, relink nodes 2 lists.

algorithm sorting mergesort