lecture1 - 6.006- Introduction to Algorithms Lecture 1...

This preview shows page 1 - 8 out of 22 pages.

The preview shows page 6 - 8 out of 22 pages.
6.006-Introduction toAlgorithmsLecture 1Prof. Constantinos Daskalakis
Today’s MenuMotivationAdministriviaCourse OverviewLinked Lists and Document DistanceIntro to“Peak Finding”
“Al-go-rithms”…wha?Remember Logarithms?they have nothing to do with AlgorithmsWell specified method for solving a problem using a finite sequence of instructionsDescription might be English, Pseudocode, orreal codeKey: no ambiguity
Al-Khwārizmī(780-850)
Efficient Algorithms: Why?Solving problems consumes resources that areoften limited/valuable:Time: Plan a flight pathSpace: Query a databaseEnergy: Save moneyBigger problems consume more resourcesNeed algorithms that“scale”to large inputs,e.g. searching the web…
Efficient Algorithms: How?Define problem:Unambiguous description of desired resultAbstract irrelevant detailAssume the cow is asphere”Pull techniques from thealgorithmictoolbox”[CLRS] class textbookImplement and evaluate performanceRevise problem/abstractionGeneralizeAlgorithm to apply to broad class of problems
AdministriviaHandout: course infoProfs: Daskalakis, JailletTAs: Goldstein, Griner, Bhattacharya, MadrySign up for class at

Upload your study docs or become a

Course Hero member to access this document

Upload your study docs or become a

Course Hero member to access this document

End of preview. Want to read all 22 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
Fall
Professor
KERSEY
Tags
Algorithms, Dot Product, Divide and conquer algorithm, Vector space model, Prof Constantinos Daskalakis

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture