Inventor of Quicksort
This is a preliminary interactive educational tool to help better understand
Quicksort was first developed by
On average, Quicksort makes O(n log n) comparisons. In the worst case, it makes
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.
The purpose of this visualization is to help better understand
the quicksort algorithm
Sir Charles Antony Richard Hoare
In this initial implementation, the left-most element of the (sub)interval is chosen as the pivot.
There are more advanced methods of choosing the pivot that are not included in this version.