Notes
Below you will find notes I took using my iPad’s Notability application. I find this app to be incredibly valuable and worth the mere dollars I paid for it. Please feel free to read through my notes and shoot me any questions you may have in the comments. I took this algorithms class with my incredibly brilliant Professor Dr. Bo Brinkman at Miami University (OH) in the Spring of 2014. You can find more documents below in the “My Algorithms Library” section, where I have my formal homework submissions, of which I spent much time working on. Also check out my Localization project page, which was a project based off the work I did in this class.
My Algorithm Notes
- Asymptotic Notation
- Running Time
- Greedy (Complete)
- Interval Scheduling
- Exchange Arguments
- Huffman Coding
- Divide & Conquer
- Divide & Conquer (Cont.)
- Master Theorem
- Strassen
- Select & Quick Select
- Mathematical Induction
- Dynamic, Weighted Interval and Memoization
- Knapsack, Subset Sum, Checkerboard
- Complexity, Reductions, Famous Problems
- Gadget Reductions, Certifiability
- Poly-time Certifiers
- P vs. NP
- Coloring & Subgraph-Iso Morphism
- 3 Color
- Computational Complexity
My Algorithm Assignments
- Homework 3 – Greedy Algorithms & Induction
- Homework 4 – Divide & Conquer
- Homework 5 – Dynamic Programming
- Homework 6 – Reductions & Complexity