tjkomor · February 9, 2016 20:36 · rrgayhart · Feb 9, 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?"
 Rule #1, never ever use bubble sort. This sorting algorithm is simply too slow and either Insertion sort or Merge sort is the better option 99.999% of the time. Insertion sort is a reasonably goos sorting algortihm if the data set you are dealing with is already mostly sorted. However, if you are working with a really large data set, merge sort might be the better option. 

 **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?"
	Rule #1, never ever use bubble sort. This sorting algorithm is simply too slow and either Insertion sort or Merge sort is the better option 99.999% of the time. Insertion sort is a reasonably goos sorting algortihm if the data set you are dealing with is already mostly sorted. However, if you are working with a really large data set, merge sort might be the better option.

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