Quicksort File: D|\data\bit143\Fall01\day1212\quicksort.sdd BIT Gerard Harrison Divide and Conquer Reduce the problem by reducing the data set. The argument being that a smaller data will easier to solve. Recursion

Quicksort File: D|\data\bit143\Fall01\day1212\quicksort.sdd BIT Gerard Harrison Quicksort outline  First choose some key from the list for which about half the keys will come before and half after. Call this key the pivot.  Then partition the items so that all those with keys less than the pivot come in one sublist, and all those with greater keys come in another.  Then sort the two reduced lists separately, put the sublists together, and the whole list will be in order.

Quicksort File: D|\data\bit143\Fall01\day1212\quicksort.sdd BIT Gerard Harrison Algorithm void QSort( int * A, int left, int right ) { int pivotIndex = Partition(A, left, right); if( pivotIndex > left + 1 ) QSort( A, left, pivotIndex ); if( pivotIndex < right - 2 ) QSort( A, pivotIndex + 1, right ); }

Quicksort File: D|\data\bit143\Fall01\day1212\quicksort.sdd BIT Gerard Harrison Partition Partition determines the pivot. Everything before pivot is less than. Everything after pivot is greater than. Pivot... These elements are all less than or equal to the pivot These elements are all greater than the pivot

Quicksort File: D|\data\bit143\Fall01\day1212\quicksort.sdd BIT Gerard Harrison Choosing the pivot  Algorithm will work for any value we choose for pivot.  Choose the first element (arbitrarily) as the pivot.  Move all values less than or equal to pivot towards the beginning of array.  Move all values greater towards the end.  Where is the dividing line?

Quicksort File: D|\data\bit143\Fall01\day1212\quicksort.sdd BIT Gerard Harrison Moving the elements  Work inwards from both ends of the array.  Start from "left" and look for first element greater than pivot.  Start from "right" and look for first element less than pivot.  Swap the two items. They will now be in the correct ends of the array.  Repeat until searching "meet".

Quicksort File: D|\data\bit143\Fall01\day1212\quicksort.sdd BIT Gerard Harrison Searching Pivot leftIndexrightIndex [7][3] When indexes cross each, we stop.

Quicksort File: D|\data\bit143\Fall01\day1212\quicksort.sdd BIT Gerard Harrison Cross over  Low becomes new pivot  exchange old pivot with new pivot Pivot leftIndexrightIndex [4][5]

int Partition(int * A, int left, int right ) { intpivot = A[left]; intindexLeft= left+1; intindexRight= right - 1; while( indexLeft < indexRight ) { while (indexLeft < right && A[indexLeft] <= pivot) indexLeft++; while (A[indexRight] > pivot) indexRight--; if (indexLeft < indexRight) Swap (A, indexLeft, indexRight); } Swap(A, left, indexRight); //swap pivot & right index return indexRight; // new location of pivot }

Quicksort File: D|\data\bit143\Fall01\day1212\quicksort.sdd BIT Gerard Harrison Analysis " Recursively, the list is divided, resulting in O(log n) Original list What about the partition function?