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

The question of which sorting algorithm should be used versus another depends on the goal of the project one is trying to solve. Our main concern with sorting algorithms are with how long it takes to complete the algorithm and also how much memory the algorithm uses. Bubble sort is a simple sorting algorithm, often used for teaching first lessons on algorithms. It's easy to understand as a visual, simple to pseudocode for a beginner, but slow in actual processing and low on the memory usage. So just in this one case alone, the positives for bubble sort are that it's simple to learn and uses little memory, but also requires a lot of time to run. Depending on the goal, the balances and trade offs one makes on sorting algorithms is dependent on the task at hand.

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

@rrgayhart