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 Sort
- not terrible in terms of speed or computing cost, but does not work well when items are far from sorted (reverse order)
- effective when items are already partially sorted or close to sorted

Bubble Sort
- slow
- operates inefficiently because it continues going through all items even when sorting is completed

Merge Sort
- fast AND stable
- on the downside, it takes more computing power

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