Sorting Algorithms Live Comparison

Standard

I was browsing internet some time ago and saved this gif comparison of major sorting algorithms against each other and it really gives you a good grasp on their speed.

sorting speed comparison

Here are some stats that I picked out from looking at this:

Fastest Slowest
Random Heap Selection
Nearly Sorted Insertion Selection
Reversed Shell Selection
Few Unique Quick3 Selection
Best All Around: Shell
Worst All Around: Selection

I think “Few Unique” is in random order, but I am not sure. Anyways, I thought this was interesting and is definitely easier than memorizing Big(O) notation. Let me know if I made a mistake.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s