v2.10.0 (4866)

# Cours scientifique - CSE103 : Introduction to Algorithms

## Descriptif

An algorithm is a sequence of instructions that allows us to solve a problem using a finite number of steps.  As such, algorithms are the procedures that we use to “compute”. We study algorithms to know what can actually be computed, in theory and in practice, and to find out how efficiently it can be done.

Introduction to Algorithms (CSE103) is an initiation into the art and science of algorithms.  This course will train students in how to think about algorithms, how to solve a wide range of problems by means of a number of algorithmic techniques, how to rigorously compare different algorithms and predict their performance, and how it is possible to formally prove that a program implementing an algorithm is correct.

Numérique sur 20

## Pour les étudiants du diplôme Bachelor of Science de l'Ecole polytechnique

### Vos modalités d'acquisition :

Midterm and final exam, both written.

Final grade = 0.5 * midterm + 0.5 * final.

Le rattrapage est autorisé (Note de rattrapage conservée écrêtée à une note seuil de 10)

### Programme détaillé

Unit 1: Introduction
Unit 2: Searching and Sorting
Unit 3: Complexity Analysis
Midterm
Unit 4: Dynamic Programming and Greedy Algorithms
Unit 5: Program Correctness
Unit 6: Algorithms on Graphs

### Mots clés

Algorithms, Complexity, Program Correctness 