**Time complexity**is a concept in computer science that deals with the quantification of the amount of

**time**taken by a set of code or algorithm to process or run as a function of the amount of input.

Also to know is, what is the average case complexity of quicksort?

This is the best case for quicksort. It also turns out that in the average case (over all possible pivot configurations), quicksort has a

**time complexity**of O(**nlog n**), the proof of which is beyond the scope of our class. Practical implementations of quicksort often pick a pivot randomly each time.What does Quicksort do?

**Quicksort is**a divide and conquer algorithm.

**Quicksort**first divides a large array into two smaller sub-arrays: the low elements and the high elements.

**Quicksort can**then recursively sort the sub-arrays.

Why is it called quick sort?

Short answer, it is

**quicksort**because it is**quick sort**. Long answer. There are many methods for sorting, some of them asymptotically**faster**than the others. Merge sort is known to be the fastest algorithm which assumes no special structure about the elements but still**quicksort is called**"**quick"sort**.