Close
This is an interactive educational tool to help better understand the quicksort algorithm and the pivot selection within that algorithm. Quicksort was first developed by Tony Hoare in 1960.

On average, Quicksort makes O(n log n) comparisons. In the worst case, it makes O(n2) comparison.

This visualization was put together using:
THIS TOOL IS PROVIDED AS IS, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE DEVELOPERS OF THIS TOOL OR ANY OTHER CONTRIBUTOR BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE TOOL.
B.F. Lyon, Lyon Mobile Apps, LLC
http://www.nowherenearithaca.com


About
B.F. Lyon Visualizations

This is an experiment as part of the process of better understanding the quicksort algorithm, developed by Sir Charles Antony Richard Hoare in 1960. In this project, the left-most element of the (sub)interval is chosen as the pivot, and the partitioning process is made audible via the web audio api. It works best with the Chrome browser, and sounds a little weird on the Safari browser.