Multiple choice

Which of the following is not correct about quicksort algorithm?

  1. The partition method returns the position of pivot element as it should be in the final sorted array.

  2. The average running time of quicksort is O(nlogn).

  3. Quicksort is faster than insertion sort and bubble sort.

  4. Best case running time of quicksort is O(nlogn).

  5. Worst case running time of quicksort is O(nlogn).
Reveal answer Fill a bubble to check yourself
E Correct answer
Explanation

This is incorrect, the worst case running time of quicksort is quadratic.

Keep practicing — related questions