robbielane · February 7, 2016 17:42 · rrgayhart · Feb 7, 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?"
 - insertion sort take very few lines of code to implement and is stable.
 - bubble sort shouldn't be used. It uses unnecessary operations.
 - merge sort is fast and stable, though it requires more lines of code.

 **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?"
	- insertion sort take very few lines of code to implement and is stable.
	- bubble sort shouldn't be used. It uses unnecessary operations.
	- merge sort is fast and stable, though it requires more lines of code.

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