Algorithms 1

In this module we introduce the basic concepts of algorithms (notion of problem, problem instance, instance size, notion of complexity, termination, proof of validity).

The algorithms presented will deal with problems related to sorting, stacks, queues, arrays.... 

- algorithms, iterative processing

- proof: validity, termination, complexity

- structures: arrays, chained lists, stacks, files

- examples of recursive functions: dichotomous search

- sorting: insertion, selection, merge sorting, other sorting examples