5 votes 5 votes Consider the following sorting algorithms. Quicksort Heapsort Mergesort Which of them perform in least time in the worst case? I and II only II and III only III only I, II and III Algorithms isro2014 algorithms sorting + – go_editor asked Jul 1, 2016 go_editor 6.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 10 votes 10 votes Worst time complexity of Quicksort = O(n2) Worst time complexity of Heapsort = O(nLogn) Worst time complexity of Mergesort =O(nLogn) Hence,Option(B) II and III . LeenSharma answered Jul 1, 2016 selected Jul 1, 2016 by ManojK LeenSharma comment Share Follow See all 0 reply Please log in or register to add a comment.
6 votes 6 votes Answer : B Heap Sort and Merge Sort shekhar chauhan answered Jul 1, 2016 edited Jul 1, 2016 by shekhar chauhan shekhar chauhan comment Share Follow See all 0 reply Please log in or register to add a comment.