24 votes 24 votes Which of the following sorting algorithms has the lowest worse-case complexity? Merge sort Bubble sort Quick sort Selection sort Algorithms gatecse-2007 algorithms sorting time-complexity easy + – Kathleen asked Sep 21, 2014 Kathleen 10.9k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Kimo123 commented Feb 4 reply Follow Share i think Bubble sort could be the answer , because if we use modification : Early termination, i.e No swapping in the inner loop then it will be O(n) 0 votes 0 votes Kimo123 commented Feb 4 reply Follow Share if we do not go with bubble sort early termination modification then ---merge sort if right answer, heap sort also having lowest worst case time complexity O(nlogn) as like merge sort. 0 votes 0 votes Please log in or register to add a comment.
Best answer 29 votes 29 votes Correct Option: A Irrespective of the input, merge sort always have a time complexity of $\Theta(n \log n)$. Gate Keeda answered Sep 23, 2014 • edited May 12, 2021 by soujanyareddy13 Gate Keeda comment Share Follow See all 0 reply Please log in or register to add a comment.
8 votes 8 votes Merge sort has lowest worst case time complexity i.e O(nlogn) Bhagirathi answered Sep 22, 2014 • edited Sep 22, 2014 by Bhagirathi Bhagirathi comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes MERGE SORT all others have the worst case complexity O(n^2) Hai Hai answered Jul 27, 2015 Hai Hai comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Irrespective of everything worst case for quick sort,bubble srt and selections sort is O(n^2) Whereas for merge sort it is O(nlog n) Arnabvasudev23 answered Aug 1, 2021 Arnabvasudev23 comment Share Follow See all 0 reply Please log in or register to add a comment.