matt-stj · February 16, 2016 22:06 · 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?"

 Speed, resources required to perform, stability, and size of incoming dataset are all things that must be taken into consideration when using sorting algorithms.  There's no single perfect solution -- the best algorithm depends on what data you have coming in, but insertion or merge sort offer the best performance + reliabililty.  Bubble sort === the worst.
	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?"

	Speed, resources required to perform, stability, and size of incoming dataset are all things that must be taken into consideration when using sorting algorithms. There's no single perfect solution -- the best algorithm depends on what data you have coming in, but insertion or merge sort offer the best performance + reliabililty. Bubble sort === the worst.