Quick Sort Algorithm in C++: Understanding the Array-Based Implementation, Lecture notes of Design

Download Quick Sort Algorithm in C++: Understanding the Array-Based Implementation and more Lecture notes Design in PDF only on Docsity! C++ Programming: Program Design Including Data Structures, Fourth Edition 1 Quick Sort: Array-Based Lists • Uses the divide-and-conquer technique – The list is partitioned into two sublists – Each sublist is then sorted – Sorted sublists are combined into one list in such a way so that the combined list is sorted 2 Quick Sort: Array-Based Lists (continued) • To partition the list into two sublists, first we choose an element of the list called pivot • The goal is to re-arrange the list so that the pivot divides the list into: lowerSublist and upperSublist – The elements in lowerSublist are < pivot – The elements in upperSublist are ≥ pivot {o] (1) (2) (3) [4] [5] [6] [7] [8) [9] [10] [11] [12] [13] FIGURE 19-40 List before sorting (0) (1) [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] pivot FIGURE 19-41 List after moving pivot to the first array position lower upper sublist sublist a pivot sar inte so FIGURE 19-42 List after a few iterations of Step 2 |-— lower sublist —+|—upper sublist —+| MEENA « ~*~ pivot smallIndex index FIGURE 19-43 List after moving 11 into the lower sublist lower sublist upper sublist fsa fee az] fer ss v0 oe CIC pivot smalliIndex index FIGURE 19-44 List before moving 58 into a sublist I lower sublist upper sublist — > ORO ooo ee pivot | smallIndex index FIGURE 19-45 List after moving 58 into the upper sublist C++ Programming: Program Design Including Data Structures, Fourth Edition 7 Quick Sort: Array-Based Lists (continued)