You are here: start / fuss / algorithms / sorting

Note

A reminder of sorting algorithms. Credit for original animated images goes to Wikipedia.

Name Best Average Worst Memory Stable Method
Quicksort $n\log{n}$ $n\log{n}$ $n^{2}$ $\log{n}$ Depends Partitioning
Merge sort $n\log{n}$ $n\log{n}$ $n\log{n}$ Worst: $n$ Yes Merging
Heapsort $n\log{n}$ $n\log{n}$ $n\log{n}$ $1$ No Selection
Insertion sort $n$ $n^{2}$ $n^{2}$ $1$ Yes Insertion
Bubble sort $n$ $n^{2}$ $n^{2}$ $1$ Yes Exchanging

Index

fuss/algorithms/sorting.txt ยท Last modified: by 127.0.0.1
You are here: start / fuss / algorithms / sorting

Wizardry and Steamworks

© 2025 Wizardry and Steamworks

Access website using Tor Access website using i2p Wizardry and Steamworks PGP Key


For the contact, copyright, license, warranty and privacy terms for the usage of this website please see the contact, license, privacy, copyright.