Introduction to algorithms

This course provides an introduction to solving simple problems using algorithms, in particular sorting problems. The only objects handled are simple types (integers, reals, etc.) or arrays and matrices of these. A few families of algorithms are introduced: divide and conquer, dynamic and gluttonous. Algorithm comparison is addressed by introducing the notion of complexity.

Introduction
Notions of problems and algorithms
Divide and conquer algorithm
Dynamic programming
Gluttonous algorithms
Sorting problem

No

Introduction
Notions of problems and algorithms
Divide and conquer algorithm
Dynamic programming
Gluttonous algorithms
Sorting problem