Question 62

Consider the following sorting algorithms.
I. Quicksort
II. Heapsort
IiI. Mergesort
Which of them perform in least time in the worst case?

Create a FREE account and get:

  • Download Maths Shortcuts PDF
  • Get 300+ previous papers with solutions PDF
  • 500+ Online Tests for Free


Boost your Prep!

Download App