Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
66 views

Quicksort - An Example: Left Left+1 Right

The document describes the quicksort algorithm for sorting an array. It works by: 1) Choosing a pivot element, typically the middle element. 2) Partitioning the array around the pivot so that all elements less than the pivot come before it and all greater elements come after. 3) Recursively applying the same process to the sub-arrays on each side of the pivot until the entire array is sorted.

Uploaded by

marryam nawaz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
66 views

Quicksort - An Example: Left Left+1 Right

The document describes the quicksort algorithm for sorting an array. It works by: 1) Choosing a pivot element, typically the middle element. 2) Partitioning the array around the pivot so that all elements less than the pivot come before it and all greater elements come after. 3) Recursively applying the same process to the sub-arrays on each side of the pivot until the entire array is sorted.

Uploaded by

marryam nawaz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Quicksort — An Example

Swap pivot element left left+1 right


with leftmost element. 38 81 22 48 13 69 93 14 45 58 79 72
We sort the array lo=left+1; hi=right;

A = (38 81 22 48 13 69 93 14 45 58 79 72) Move hi left and lo lo hi hi hi


right as far as we can;

in position ¬(left+right)/ 2¼.


with quicksort, always choosing the pivot element to be the element then swap A[lo] and 69 81 22 48 13 38 93 14 45 58 79 72*
* * *

A[hi], and move hi and


lo one more position.
lo lo lo lo lo hi
The partitioning during the top-level call to quicksort() is illustrated Repeat above 69 58 22* 48* 13* 38* 93* 14 45* 81 79 72
on the next page. During the partitioning process,
i) Elements strictly to the left of position lo are less than or Repeat above until hi hi
and lo cross; then hi is lo lo
equivalent to the pivot element (69). the final position of the 69 58 22 48 13 38 45 14 93* 81 79 72 **
pivot element, so swap
ii) Elements strictly to the right of position hi are greater than A[hi] and A[left].
the pivot element. hi
Partitioning complete;
return value of hi. 14 58 22 48 13 38 45 69 93 81 79 72
When lo and hi cross, we are done. The final value of hi is the
position in which the partitioning element ends up.

An asterisk indicates an element compared to the pivot element at


that step.
The Quicksort Algorithm
(each interval partitioned using its middle element)

partition( A, left, right) rarranges A[left .. right] and finds and returns an
integer q, such that
a pivot, A[q] = pivot, A[q+1], ..., A[right] > pivot,
A[left], ..., A[q–1] <
where pivot is the middle element of a[left..right], before partitioning. (To
choose the pivot element differently, simply modify the assignment to m.)

m = ¬left + right¼ / 2;
Integer partition( T[] A, Integer left, Integer right)

swap( A[left], A[m]);


pivot = A[left];
lo = left+1; hi = right;
while ( lo ” hi )
while ( A[hi] > pivot )
hi = hi – 1;
while ( lo ” hi and A[lo] < a pivot )
lo = lo + 1;
if ( lo ” hi )
swap( A[lo], A[hi]);
lo = lo + 1; hi = hi – 1;
swap( A[left], A[hi]);
return hi

quicksort( A, left, right) sorts A[left .. right] by using partition() to partition


A[left .. right], and then calling itself recursively twice to sort the two subarrays.

void quicksort( T[] A, Integer left, Integer right)


if ( left < right )
q = partition( A, left, right);
quicksort ( A, left, q–1);
quicksort ( A, q+1, right);

You might also like