Skip to content

Instantly share code, notes, and snippets.

@jillmd501

jillmd501/gist:3c1e602de98ccfd0a3f4

Forked from stevekinney/gist:9e9cfeb225c8133fda73
Created February 9, 2016 00:19
Show Gist options
  • Save jillmd501/3c1e602de98ccfd0a3f4 to your computer and use it in GitHub Desktop.
Save jillmd501/3c1e602de98ccfd0a3f4 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
gistfile1.txt
**Step One**: Watch [Sorting Algorithms in JavaScript](https://www.youtube.com/watch?v=uRyqlhjXYQI)
**Step Two**: Fork this gist.
**Step Three**: Respond to this question in your fork: "What are some of the balances and trade offs between different sorting algoritms?"
**Step Four**: _Totally Optional_: take a look at some of the other forks and comment if the spirit moves you.
@jillmd501
Copy link
Author

First off, this lady is a talker! Secondly, it sounds like it comes down to space and time for what sort method to use. We all remember the infamous Bubble Sort video from Cheek which is great for memory, but pretty slow to be honest. I have never heard of insertion sort until this, but it appears that it is in between merge and bubble as time vs memory goes. Merge is super quick, but comes with the caveat of a ton of memory.

@rrgayhart
Copy link

Haha - I usually watch conf talk videos at double speed.. but not this one, not this one...

👍

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment