Peak Finding — Lec 1 Notes
Source: 6.006 Intro to Algorithms — Lec 1 · MIT OCW
Chapter notes
MIT OCW| 02:14 | What is an algorithm? |
| 08:30 | 1-D peak finding · brute force = Θ(n) |
| 18:05 | Divide & conquer approach |
| 27:40 | Master theorem ⇒ Θ(log n) |
| 36:12 | 2-D peak finding · why naive fails |
Active recall
MIT OCW- 1: Brute-force 1-D peak finding complexity? Answer: Θ(n).
- 2: Why does divide & conquer give Θ(log n) here?
Saved to
MIT OCWMIT 6.006 · Algorithms — 4 of 24 lectures captured.



