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

Fast algorithms can take up a lot of memory, and vice versa. ie. merge sort takes up a ton of space but is much faster than insertion sort that is slower but also takes up less memory.  This is a particularly important consideration if you are working with very large sets of data.  Bubble sort can be twice as slow as insertion sort even if it has a smaller amount of data.

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

Fast algorithms can take up a lot of memory, and vice versa. ie. merge sort takes up a ton of space but is much faster than insertion sort that is slower but also takes up less memory. This is a particularly important consideration if you are working with very large sets of data. Bubble sort can be twice as slow as insertion sort even if it has a smaller amount of data.