MattRooney · February 16, 2016 22:05 · rrgayhart · Feb 16, 2016
diff --git a/gistfile1.txt b/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?"

 - Runtime (Big O) - Insertion and Bubble are slow, O(n^2). Merge is fast, O(n log n).
 - Stability - stable sorts maintain the relative order of items with equal "values" (ex. Alex, before Adam when sorted on A). Insertion and Merge sort are stable, bubble sort is not.
 - Implementation - none of them are that hard to implement. 

 While Merge is fast and stable, it requires a lot of resources. Bubble sort is not so great (slow and unstable). Insertion is a bit slow, but stable and requires little resources.

 **Step Four**: _Totally Optional_: take a look at some of the other forks and comment if the spirit moves you.
	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?"

	- Runtime (Big O) - Insertion and Bubble are slow, O(n^2). Merge is fast, O(n log n).
	- Stability - stable sorts maintain the relative order of items with equal "values" (ex. Alex, before Adam when sorted on A). Insertion and Merge sort are stable, bubble sort is not.
	- Implementation - none of them are that hard to implement.

	While Merge is fast and stable, it requires a lot of resources. Bubble sort is not so great (slow and unstable). Insertion is a bit slow, but stable and requires little resources.

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