Sorting is one of the most common functions performed by a computer, and Quicksort is one of the most efficient ways to do it. This article demonstrates the usefulness of a graphical debugger for ...

In big-O terms, quicksort is identical in the best case (O (N log N)), and worse in the worst case (O (N^2) for standard, naive quicksort). Quicksort may well have better constant factors, however, ...