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 sorting algorithm you choose depends on what you're sorting and how many resources you have to allocate. 
    * Bubble sorts can very little memory but are slow and unstable. 
    * Insertion sorts are stable but have similar downsides to bubble sorts. They're not ideal for large amounts of data.
    * Merge sorts are kind of like the Cadillac of sorting algorithms, but like a Cadillac, they takes a lot of resources. If you have the memory to give, the merge sort is fast and stable. 
    
**Step Four**: _Totally Optional_: take a look at some of the other forks and comment if the spirit moves you. 

👍