Académique Documents
Professionnel Documents
Culture Documents
anIntroduction
History
Thiscoursewasfirsttaughtinthelate1960s
Themainprincipalsthatmaintainedthearea
Findalgorithmsthatarefastforverylarge
inputs
Assumeaverysimplemodelofacomputer
Thereareveryfastandusefulalgorithmsout
thereforthefinding.
AsymptoticAnalysis
Weonlycareabouttherunningtimeofour
algorithmasthesizeoftheinputgoesto
infinity.
TheRAMComputerModel
Therandomaccessmachine(RAM)
Singleprocessor
Unittimeaddressablememory
Unittimemultiplicationandadditionof
numbers.(lognbitnumbers)
AmazingAlgorithms
NumberTheoryandcryptography
PrimesinP
LinearprogrammingandBusiness
ComputationalGeometryandGraphic
GraphAlgorithmsand
Biology
Internet
Manufacturing
SkillsTaught
ProofsofCorrectness
Analysisofrunningtimes
Decompositionofalargerproblem
E.g.usingdatastructures
Classifyingdifferentalgorithms
Abstractalgorithmproblem
Searchtheliterature
Demonstratenegativeanswers