|
|
@@ -802,7 +802,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|
|
- Selection sort and insertion sort are both O(n^2) average and worst case
|
|
|
- For heapsort, see Heap data structure above.
|
|
|
|
|
|
-- [ ] For curiosity - not required:
|
|
|
+- [ ] Not required, but I recommended them:
|
|
|
- [ ] [Sedgewick - Radix Sorts (6 videos)](https://www.youtube.com/playlist?list=PLe-ggMe31CTcNvUX9E3tQeM6ntrdR8e53)
|
|
|
- [ ] [1. Strings in Java](https://www.youtube.com/watch?v=zRzU-FWsjNU&list=PLe-ggMe31CTcNvUX9E3tQeM6ntrdR8e53&index=6)
|
|
|
- [ ] [2. Key Indexed Counting](https://www.youtube.com/watch?v=CtgKYmXs62w&list=PLe-ggMe31CTcNvUX9E3tQeM6ntrdR8e53&index=5)
|
John Washam