From dc316c8f878690fe0a2d00b4e431f26997d36f70 Mon Sep 17 00:00:00 2001 From: John Washam Date: Wed, 29 Jun 2016 10:22:09 -0700 Subject: [PATCH] Added disclaimer about adding more detail once I get to a section. --- README.md | 20 ++++++++++++++++++-- 1 file changed, 18 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 0afc0eb..25340ac 100644 --- a/README.md +++ b/README.md @@ -363,7 +363,7 @@ Then test it out on a computer to make sure it's not buggy from syntax. ## Trees -- [x] Notes: +- [x] Notes & Background: - [x] Series: https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees - [x] Series: https://www.coursera.org/learn/data-structures/lecture/95qda/trees - basic tree construction @@ -453,6 +453,7 @@ Then test it out on a computer to make sure it's not buggy from syntax. Min Heap / Max Heap - [ ] **Disjoint Sets:** + - UCB: https://www.youtube.com/watch?v=wSPAjGfDl7Q&list=PL4BBB74C7D2A1049C&index=31 - https://www.coursera.org/learn/data-structures/lecture/JssSY/overview - https://www.coursera.org/learn/data-structures/lecture/EM5D0/naive-implementations - https://www.coursera.org/learn/data-structures/lecture/Mxu0w/trees @@ -464,10 +465,12 @@ Then test it out on a computer to make sure it's not buggy from syntax. - Notes: - visualized as a tree, but is usually linear in storage (array, linked list) - https://en.wikipedia.org/wiki/Priority_queue - + - https://www.youtube.com/watch?v=yIUFT6AKBGE&index=24&list=PL4BBB74C7D2A1049C ## Graphs + This area is sparse (no pun intended), and I'll be filling it in once I get here. + - Notes: - There are three basic ways to represent a graph in memory: - objects and pointers @@ -482,6 +485,12 @@ Then test it out on a computer to make sure it's not buggy from syntax. - https://en.wikipedia.org/wiki/A*_search_algorithm - When asked a question, look for a graph-based solution first, then move on if none. +- Graphs: + - https://www.youtube.com/watch?v=ylWAB6CMYiY&list=PL4BBB74C7D2A1049C&index=27 + +- Weighted graphs: + - https://www.youtube.com/watch?v=zFbq8vOZ_0k&list=PL4BBB74C7D2A1049C&index=28 + - Compute Strongly Connected Components - [ ] https://www.coursera.org/learn/algorithms-on-graphs/home/week/5 @@ -494,6 +503,8 @@ You'll get more graph practice in Skiena's book (see Books section below) and th ## Sorting + This area is sparse, and I'll be filling it in once I get here. + - [ ] Notes: - [ ] Implement & know best case/worst case, average complexity of each: - no bubble sort - it's terrible - O(n^2) @@ -515,6 +526,8 @@ You'll get more graph practice in Skiena's book (see Books section below) and th ## Even More Knowledge + This area is sparse, and I'll be filling it in once I get here. + - [ ] Caches - LRU cache @@ -831,6 +844,9 @@ Sit back and enjoy. "netflix and skill" :P - Skiena lectures from Algorithm Design Manual - https://www.youtube.com/watch?v=ZFjhkohHdAA&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=1 +- [ ] UC Berkeley 61B + - https://www.youtube.com/playlist?list=PL4BBB74C7D2A1049C + - [ ] MIT 6.042: Math for CS (25 videos): - https://www.youtube.com/watch?v=L3LMbpZIKhQ&list=PLB7540DEDD482705B