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

The most important things to think about when chosing a sorting algorithm are space and time.. OOoooOOoooOoo. By space I mean memory to perform calculations. And by time, I mean how long the sorting algorithm will take. Bubble sort is slow, but takes up little memory, and Merge sort is super fast, but takes up large chunks of memory to perform it's recursive functions. Insertion sort is right in the middle, which makes it desirable in some occasions. However, like most times in programming, the answer of which sorting algorithm to use, is 'it depends'

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