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?"

* Need to consider: space, time, type of data
*insertion - good for small sets of data/if it's mostly already sorted, compares what needs to be sorted
*bubble -  slow, checks through every item, no bueno
*merge - multi-branch (splits array) recursive sort, fast and stable, not going to work with a ton of data if you are doing it in the browser

**Step Four**: _Totally Optional_: take a look at some of the other forks and comment if the spirit moves you.