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?"
  - Insertion
   - pros are that it is a stable sort and good for small data sets (use if you are sorting on the browser)
   - cons are that its slow with big data (O(n2)
  -Bubble 
    - pros are that it is easy to implement and good for small data
    - cons are that it is not stable and very slow
  - merge
   - pros are that it is stable and fast ( most likely not sorting on the browser side )
   - cons are that it requires lots of memory

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