Algorithms/Data Structures: Difference between revisions
From charlesreid1
(→Notes) |
|||
| Line 14: | Line 14: | ||
Already reviewed Skiena's data structures section, see [[Advanced Data Structures]] page. | Already reviewed Skiena's data structures section, see [[Advanced Data Structures]] page. | ||
==MIT 6.046 course== | |||
Fall 2005 version of 6.046 provided on MIT's Open CourseWare page: | |||
* Main page: https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/ | |||
* Video lectures: https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/ | |||
* Lecture 4 - randomized algorithms | |||
* Lecture 5 - linear time sorting, lower bounds | |||
* Lecture 9 - analysis of random BST | |||
* Lecture 12 - skip lists | |||
* Lecture 13 - amortization, table doubling | |||
* Lots of advanced material | |||
Revision as of 23:39, 11 July 2017
Notes
Goodrich book
Sections covering algorithmic analysis:
- 4 - analysis of recursive algorithms
- 5 - dynamic array amortization
- 8 - tree traversal algorithms
- 9 - heap construction
- 10 - hash efficiency, probabilistic analysis of skip list
- 11 - amortization of splaying/balancing
Skiena book
Already reviewed Skiena's data structures section, see Advanced Data Structures page.
MIT 6.046 course
Fall 2005 version of 6.046 provided on MIT's Open CourseWare page:
- Main page: https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/
- Video lectures: https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/
- Lecture 4 - randomized algorithms
- Lecture 5 - linear time sorting, lower bounds
- Lecture 9 - analysis of random BST
- Lecture 12 - skip lists
- Lecture 13 - amortization, table doubling
- Lots of advanced material
 |
Algorithms Part of Computer Science Notes
Series on Algorithms
Algorithms/Sort · Algorithmic Analysis of Sort Functions · Divide and Conquer · Divide and Conquer/Master Theorem Three solid O(n log n) search algorithms: Merge Sort · Heap Sort · Quick Sort Algorithm Analysis/Merge Sort · Algorithm Analysis/Randomized Quick Sort
Algorithms/Search · Binary Search · Binary Search Modifications
Algorithms/Combinatorics · Algorithms/Combinatorics and Heuristics · Algorithms/Optimization · Divide and Conquer
Algorithms/Strings · Algorithm Analysis/Substring Pattern Matching
Algorithm complexity · Theta vs Big O Amortization · Amortization/Aggregate Method · Amortization/Accounting Method Algorithm Analysis/Matrix Multiplication
Estimation Estimation · Estimation/BitsAndBytes
Algorithm Practice and Writeups Project Euler · Five Letter Words · Letter Coverage
|