Skip to Main Content
Programming and Data Structures
book

Programming and Data Structures

by Ashok Kamthane
August 2009
Intermediate to advanced content levelIntermediate to advanced
604 pages
21h 39m
English
Pearson India
Content preview from Programming and Data Structures
Searching and Sorting 579
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.
Start your free trial

You might also like

Learning Data Structures and Algorithms

Learning Data Structures and Algorithms

Rod Stephens
Data Structures and Algorithms in C++, Second Edition

Data Structures and Algorithms in C++, Second Edition

Michael T. Goodrich, Roberto Tamassia, David M. Mount

Publisher Resources

ISBN: 9789332506343