In a linked list since random access is a slow process or we can say not so feasible, quick sort is very slow(due to lot of random access) and heap sort is impossible.Thus we go with merge sort as in this we only have to keep track of two pointers and no extra space is needed during the merge operation as insertion in linked list is O(1) .O(nlogn)