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?"
-It all depends on what type of data you're sorting and whether you're trying to optimize for use of memory/computing power
-Bubble sort is useful to study but generally not useful in real world application. They're slow and take a lot of memory
-Insertion sorts are better in that they're more stable, but for application on large datasets are still bad
-Merge sort is all around the best, but highly data intensive. Definitely the best option with a lot of computing power.

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