This is the first notes from MIT Introduction to Algorithms.
Prof : Charles Leiserson.
Prerequisites
- Math for Computer Science.
- Discrete mathematics.
- Probability.
- Programming Experience.
A one-hour recitation session each week.
Analysis of Algorithms
Q : Why study algorithms?
A : It’s the theoretical study of computer program performance and resource usage.Resource : communication, memory (including RAM memory & disk memory) etc.
Q : In programming, what is more importance than performance?
A : Maybe Security, Maintainability and so on.- Q : Why do we bother between performance and security or other factors?
A : In fact, performance likes money. You can use it to pay for other things that you want.
Problem of sorting
It contains many algorithmic techniques.