Forked from stevekinney/gist:9e9cfeb225c8133fda73
Last active
February 9, 2016 20:27
-
-
Save toriejw/8117b31137098dbf6f0d to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
**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?" | |
All algorithms have different "attributes": stability, runtime analysis, and implementation. A sorting algorithm is chosen based on the necessary combination of these attributes. Some algorithms are fast, but take up a lot of space, which you might not have. Some algorithms are simpler, but don't perform as well. | |
**Step Four**: _Totally Optional_: take a look at some of the other forks and comment if the spirit moves you. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
👍