1 votes 1 votes Which of the following algorithm is best suitable for sorting of linked list? Quick Sort Merge Sort Heap Sort None of these nandini gupta asked Jan 16, 2019 nandini gupta 353 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply prashant jha 1 commented Jan 16, 2019 reply Follow Share It's Merge Sort . 0 votes 0 votes Gupta731 commented Jan 16, 2019 reply Follow Share Merge Sort 0 votes 0 votes OneZero commented Jan 16, 2019 reply Follow Share Merge sort. it still remains O(nlong) quick and heap sort will become O(n^2). 0 votes 0 votes Please log in or register to add a comment.