Week 1-2: Introduction to Analysis of Algorithms, Asymptotic Notation

Why Analysis of Algorithms?

  • Analyze the asymptotic performance of algorithms.
  • Demonstrate a familiarity with major algorithms and data structures.
  • Apply important algorithmic design paradigms and methods of analysis.
  • Synthesize efficient algorithms in common engineering design situations.

After completing this lesson, you should be able to:

  • Difference between Program and Algortihm
  • Accuracy, Efficiency and Comparison between different efficeincies
  • Different Representation of Algortihms
  • Order of Growth
  • Asymptotic Notation

Download Files

lect-1-introduction.ppt (1.68 MB )