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?"

1. Insertion Sort - great for almost fully sorted arrays - takes up little space - however when the dataset is completely reversed it is slow 
2. Bubble Sort has no advantages. Slow and not stable - It checks through every item which makes it slow. Order 2n - worst possible scenario. 

3. Merge Sort - fast and stable - however takes up more space - as you need temporary space for arrays and recursive calls. 

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

👍