In worst case Quick Sort has order

Options
- O (n log n)
- O (n2)
- O (log n)
- O (n2/4)

CORRECT ANSWER : O (n2)

Discussion Board
Data Structure - Quick Sort

In worst case Quick Sort has order O(n2). Quick sort is the quickest comparison-based sorting algorithm. It is very fast and requires less additional space, only O(n log n) space is required.

Prajakta Pandit 02-1-2017 06:59 AM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲