Algorithm for Shuffling a Linked List in n log n time

Question

I\'m trying to shuffle a linked list using a divide-and-conquer algorithm that randomly shuffles a linked list in linearithmic (n log n) time and logarithmic (log n) extra space

Answer 1

You could traverse over the list, randomly generating 0 or 1 at each node.

If it is 1, remove the node and place it as the first node of the list. If its is 0, do nothing.

loop this until you reach the end of the list.