Added sorting use case exercise

Author: CoffeelessProgrammer

Algorithms/README.md

@@ -5,7 +5,7 @@
 - [ ] Dynamic Programming
 - [X] Comparison Sorting
   - [X] *Merge Sort*
-  - [X] *Quick Sort*
+  - [X] *Quicksort*
   - [X] Bubble Sort
   - [X] Selection Sort
   - [X] Insertion Sort
@@ -17,14 +17,25 @@
 
 ## Resources
 - [Visualizing Data Structures & Algorithms](https://visualgo.net/en)
-- [Unicode Characters: RapidTables](https://www.rapidtables.com/code/text/unicode-characters.html)
+- [Unicode Characters | RapidTables](https://www.rapidtables.com/code/text/unicode-characters.html)
 - [The Big-O Algorithm Complexity Cheat Sheet](https://www.bigocheatsheet.com/ "Big O Cheat Sheet")
 
 ### Sorting
 - [Array.prototype.sort()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort)
-- [Animated Sorting: Toptal](https://www.toptal.com/developers/sorting-algorithms)
-- [Dancing Algorithms: AlgoRythmics](https://www.youtube.com/user/AlgoRythmics/videos)
-- [Importance of Stability in Sorting](https://stackoverflow.com/questions/1517793/what-is-stability-in-sorting-algorithms-and-why-is-it-important)
+- [Animated Sorting | Toptal](https://www.toptal.com/developers/sorting-algorithms)
+- [Dancing Algorithms | AlgoRythmics](https://www.youtube.com/user/AlgoRythmics/videos)what-is-stability-in-sorting-algorithms-and-why-is-it-important)
+- [QuickSort vs Heapsort](https://stackoverflow.com/questions/2467751/quicksort-vs-heapsort)
+- [Importance of Stability in Sorting](https://stackoverflow.com/questions/1517793/)
+
+### Most Common Sorts
+- [Merge Sort | Brilliant.org](https://brilliant.org/wiki/merge/)
+- [Quicksort | Brilliant.org](https://brilliant.org/wiki/quick-sort/)
+- [Heap Sort | Brilliant.org](https://brilliant.org/wiki/heap-sort/)
+- [Radix Sort | Brilliant.org](https://brilliant.org/wiki/radix-sort/ "Non-Comparison Sort")
+- [Radix Sort Visualization](https://www.cs.usfca.edu/~galles/visualization/RadixSort.html)
+- [Counting Sort | Brilliant.org](https://brilliant.org/wiki/counting-sort/ "Non-Comparison Sort")
+- [Counting Sort Visualization](https://www.cs.usfca.edu/~galles/visualization/CountingSort.html)
 
 ### Recursion
-- [Tail Call Optimization: ES6](https://2ality.com/2015/06/tail-call-optimization.html)
+- [Recursion | Brilliant.org](https://brilliant.org/wiki/recursion-problem-solving/)
+- [Tail Call Optimization in ES6](https://2ality.com/2015/06/tail-call-optimization.html)

Algorithms/Sorting/SortingUseCases_Exercise.md

@@ -0,0 +1,30 @@
+# Sorting Use Cases
+
+## Which sorting algorithm would be a good candidate for each situation?
+
+1) Sort 10 schools around your house by distance.
+
+2) eBay sorts listings by the current Bid amount.
+
+3) Sport scores on ESPN.
+
+4) Massive database (can't fit all into memory) needs to sort through past year's user data.
+
+5) Almost sorted Udemy review data needs to update and add 2 new reviews.
+
+6) Temperature Records for the past 50 years in Canada.
+
+7) Large user name database needs to be sorted. Data is very random.
+
+8) You want to teach sorting for the first time.
+
+
+## Potential Candidates
+1) Insertion Sort
+2) Radix/Counting Sort
+3) Quicksort
+4) Merge Sort
+5) Insertion Sort
+6) Radix/Counting Sort or Quicksort
+7) Mergesort/Quicksort
+8) Bubble Sort, Selection Sort

Playground/Demos/Objects_101.ts

@@ -17,9 +17,9 @@ console.log(episode1);
 console.log('------------------------- Episode 2 -------------------------');
 const episode2 = Object.create(episode1);
 
-console.log(episode2);  // While fields don't show on console
-console.log(episode2.name, '—', episode2['characters']); // They are still populated by passed in prototype
-console.log(episode2.introduction()); // Function also exists because episode1 used as prototype
+console.log(episode2);                                      // While fields don't show on console,
+console.log(episode2.name, '—', episode2['characters']);    // they are still populated by passed in prototype.
+console.log(episode2.introduction());                       // Function also exists because episode1 used as prototype.
 
 episode2.name = 'The Avatar Returns';
 episode2['location'] = ['Southern Water Tribe', "Zuko's Ship"];  // Recommended assignment syntax

README.md

@@ -21,7 +21,7 @@
 - [ ] Dynamic Programming
 - [X] Comparison Sorting
   - [X] *Merge Sort*
-  - [X] *Quick Sort*
+  - [X] *Quicksort*
 - [ ] Searching
   - [ ] Linear Search
   - [ ] Binary Search