Scribd
Upload
72 views6 pages

Introduction Algorithmique

This document provides an introduction to algorithms, including a brief history of algorithms courses being taught since the 1960s with a focus on finding fast algorithms for large inputs using a simple computer model. It outlines the use of asymptotic analysis to analyze running times as the input size approaches infinity and describes the random-access machine computer model. It also highlights some amazing algorithms from fields like number theory, linear programming, computational geometry, and graph algorithms and their applications in biology, the internet, and manufacturing. Finally, it lists skills taught like proofs of correctness, running time analysis, problem decomposition, classifying algorithms, and searching the literature.

Uploaded by

ZAKARIA SALHI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
72 views6 pages

Introduction Algorithmique

This document provides an introduction to algorithms, including a brief history of algorithms courses being taught since the 1960s with a focus on finding fast algorithms for large inputs using a simple computer model. It outlines the use of asymptotic analysis to analyze running times as the input size approaches infinity and describes the random-access machine computer model. It also highlights some amazing algorithms from fields like number theory, linear programming, computational geometry, and graph algorithms and their applications in biology, the internet, and manufacturing. Finally, it lists skills taught like proofs of correctness, running time analysis, problem decomposition, classifying algorithms, and searching the literature.

Uploaded by

ZAKARIA SALHI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 6

Algorithms

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

You might also like