Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSorting algorithms

Quick sort

About quicksort

Report a typo

Select correct statements about quicksort.

Select one or more options from the list

After the algorithm has performed the partitioning, the subarrays on both sides of the pivot are already sorted.

If we use the rightmost element as the pivot, the worst-case time complexity is O(n log n).

The time complexity is O(n log n) in the average case.

Any element can be used as the pivot.

___

Create a free account to access the full topic