-
-
Save damwhit/aa460542fe2df380a50c2d48aa0fa28b 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?" | |
| Fast algorithms can take up a lot of memory, and vice versa. ie. merge sort takes up a ton of space but is much faster than insertion sort that is slower but also takes up less memory. This is a particularly important consideration if you are working with very large sets of data. Bubble sort can be twice as slow as insertion sort even if it has a smaller amount of data. | |
| **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
Fast algorithms can take up a lot of memory, and vice versa. ie. merge sort takes up a ton of space but is much faster than insertion sort that is slower but also takes up less memory. This is a particularly important consideration if you are working with very large sets of data. Bubble sort can be twice as slow as insertion sort even if it has a smaller amount of data.