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?"
-It can depend on the size and presortedness of the collection. Merge sort scales well for large collections. Insertion sort works well with smaller lists and when the items are already sorted. Bubble sort is inefficient by comparison, and doesn't scale.

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