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

Bottom up merge sort without compares. while merging don't do any comparison just swap the elements.