Question

What is the average running time for quicksort?

		O(1)
		O(log10N)
		O(log2N)
		O(log2N)
		O(N)
		O(N log N)
		O(N2)
		O(N3)
		O(Nk)
		O(2N)
		O(N!)

Answer 1

Let's take an Array to contain N elements:

The Average Running time of Quick Sort is O(N logN).

From the above figure, the average running time-based levels splitted =

Quick Sort uses the recursive approach.

If you need any help regarding the answer do let me know.