Scribd
Upload
15 views

Quick S

The document demonstrates the steps of quicksort algorithm by showing the sorting of numbers from an unsorted to sorted array through a series of steps where the pivot element is chosen and elements are swapped around it.

Uploaded by

Johan Sebastian Perez Castañeda
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
15 views

Quick S

The document demonstrates the steps of quicksort algorithm by showing the sorting of numbers from an unsorted to sorted array through a series of steps where the pivot element is chosen and elements are swapped around it.

Uploaded by

Johan Sebastian Perez Castañeda
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Quick Sort

0 1 2 3 4 5 6 7 8 9
1 0 0 0 5 0 3 4 9 3

1 0 0 0 5 0 3 4 9 3

1 0 0 0 5 0 3 4 9 3

1 0 0 0 5 0 3 4 9 3

1 0 0 0 5 0 3 4 9 3

1 0 0 0 5 0 3 4 9 3

0 0 0 0 5 1 3 4 9 3

0 0 0 0 5 1 3 4 9 3

0 0 0 0 5 1 3 4 9 3

0 0 0 0 5 1 3 4 9 3

0 0 0 0 1 5 3 4 9 3

0 0 0 0 1 5 3 4 9 3

0 0 0 0 5 3 4 9 3

0 0 0 0 3 3 4 9 5

0 0 0 0 3 3 4 9 5

0 0 0 0 3 3 4 9 5
0 0 0 3 3 4 5 9

0 0 0 3 3 4 9

0 0 3 3 4

0 3 4
0 0 0 0
4

3 3 4 9

3 3 4 5 9

0 0 0 0 1 3 3 4 5 9

You might also like