Lecture 1 : Algorithmic Thinking, Peak Finding

https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/lecture-videos/lecture-1-algorithmic-thinking-peak-finding/

인터넷 강의를 들으면서 중요한 내용들을 정리...
------------------------------------------------------------------------------------------------

Course Overview

• Efficient procedures for solving large scale problems
• Scalability
• Class Data Sturucture & Classical Algorithms
• Real Implementation in Python

Content

8 moduels (Including Problem Set)

1. Algorithmic thinking : peak finding
2. Sorting & trees : Event simulation (logic network)
3. Hashing : Genome comparison
4. Numerics : RSA encryption
5. Graphs : Rubik's cube
6. Shortest paths : Clatech -> MIT
7. Dynamic programming : Image compression
8. Advanced topics : 

- Peak finding

One-dimensional version

Peak? 

Position 2 is a peak if and only if b >=a and b>= c

In case of edge, you should compare only one element.

Problem : find a peak if it exists.

Straightforward algorithm

start from left 

1 2 ... n/2   ...  n-1 n