Thus, the number of comparisons is proportional to (n2). The time complexity of bubble sort is
0 (n2).
16.9 QUICKSORT
It is also known as partition exchange sort. It was invented by C A R Hoare. It is based on partition.
Hence, the method falls under divide and conquer technique. The main list of element is divided
into two sub-lists. For example, suppose a list of X elements are to be sorted. The quick sort marks
an element in a list called as pivot or key. Consider the first element / as a pivot. Shift all the
elements whose value is less than J towards the left and elements whose value is grater than J to
ri ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.