|
Continued from the previous
page, you continue the above process until the left index
pointer - i becomes greater than your right index pointer
- j:
You will learn what to do when that happens in the next
section when I go through a thorough walkthrough of
quicksort working on a simple list of numbers.
Before I start the walkthrough, let me provide the basic
pseudocode used for quicksort:
To make it easier on you, click on the above image to
open the pseudocode image in a new window. That way, you can
easily refer to it even as you are navigating through other
pages.
Onwards to the walkthrough on the
next page!
|
Fast Sorting with Quicksort
