└── README.md /README.md: -------------------------------------------------------------------------------- 1 | # NoteBook 2 | 3 | [CS61B Data Structure](#CS61B-data-structure) UC Berkeley. Spring 2018. @source Josh Hug _01/10/2019-_ 4 | 5 | [Javascript: Understanding The Weird Parts](#javascript-understanding-the-weird-parts) Udemy 6 | 7 | # CS61B Data Structure 8 | - [Lecture 1 Intro, Hello World Java](../../issues/79) 9 | - [Lecture 2 Define and Using Classes](../../issues/80) 10 | - [Lecture 3 References, Recursion, and Lists](../../issues/81) 11 | - [Lecture 4 SLLists, Nested Classes, Sentinel Nodes](../../issues/83) 12 | - [Lecture 5 DLLists, Arrays](../../issues/84) 13 | - [Lecture 6 Lecture 6 ALists, Resizing, vs. SLists + proj1a](../../issues/85) 14 | - [Lecture 7 Testing + lab3 + disc03 + Exam Prep 03: Linked Lists, Arrays](../../issues/86) 15 | - [Lecture 8 Inheritance, Implements + Project 1B: Testing and HoFs](../../issues/88) 16 | - [Lecture 9 Extends, Casting, Higher Order Functions](../../issues/89) 17 | - [Lecture 31 Dynamic Programming Course](../../issues/119) 18 | - [Lecture 32 Basic Sorting Algorithms](../../issues/122) 19 | - [Lecture 33 Quick Sort](../../issues/123) 20 | - [Lecture 34 More Quick Sort, Stability, Shuffling](../../issues/124) 21 | - [Lecture 35 Sorting and Algorithmic Bounds](../../issues/125) 22 | - [Lecture 36 Radix Sorts](../../issues/126) 23 | - [Lecture 37 Overview, Tries](../../issues/127) 24 | - [Lecture 38 Compression](../../issues/128) 25 | - todo: 26 | - figure out why SuperZip is impossible. 27 | - [Lab9 Tree Maps vs. Hash Maps](../../issues/108) 28 | - todo: optimize `remove` 29 | - [Lab10 Heap Min PQ](../../issues/114) 30 | - todo: 31 | - ~~***get the fullscore from Gradescope***~~ 32 | - sink: figure out a clear and simple implementation 33 | - [Lab11 Graphs](../../issues/121) 34 | - todo: 35 | - optimize A* algorithm 36 | 37 | - [Lab12 Merge Sort and Quick Sort](../../issues/129) 38 | - [Disc10 Heaps, Traversals & Trees](../../issues/113) 39 | - [Disc11 Graphs](../../issues/131) 40 | - [Disc12 Graphs, Sorting](../../issues/133) 41 | 42 | - [Exam Prep 10 Heaps and Graphs](../../issues/128) 43 | - [Exam Prep 11 Graphs](../../issues/132) 44 | - [Exam Prep 12 MST/SP](../../issues/135) 45 | - todo: 46 | - figure out the concept of the Q3 47 | 48 | - [HW3 Hashing](../../issues/112) 49 | - figure out: `testWithDeadlyParams` problem 50 | - [HW4 Puzzle](../../issues/120) 51 | 52 | - [Midterm 2](../../issues/115) 53 | 54 | NOT FINISIH: 55 | - Lecture 39 Reductions, Algorithmic Bounds, NP Completeness 56 | - Lecture 40 Summary, Fun 57 | - Proj2 58 | - Proj3: BearMaps 59 | 60 | - HW 5: Seam Carving 61 | 62 | - Disc13 More Sorting 63 | - Exam Prep Sorting 64 | - Lab12 Radix Sorts 65 | - Lab13 Fractal Sound 66 | 67 | - Makeup Lab: HugLife 68 | - Makeup HW 6 boggle 69 | - Makeup HW 7 Compression 70 | 71 | 72 | # Project 73 | - [BOT Design Note](../../issues/87) 74 | 75 | # Javascript: Understanding The Weird Parts 76 | --------------------------------------------------------------------------------