Merge Sort can be used for sorting Linked List and It will take O(nlogn).
We'll not prefer others :
1. Insertion Sort: takes O(n^2) . But we need Smaller TC.
2. QuickSort: Can't Be implemented Using LinkedList Because Indexing is Involved in Quicksort. But no indexing is present in LinkedList.
3. HeapSort: It requires The element of the linked list to be stored in an array , SInce HeapSort can only be implemented on an array Easily.