ECTS
5 credits
Component
Faculty of Science
Description
In this module we present the basic concepts in algorithms (notion of problem, problem instance, instance size, notion of complexity, termination, proof of validity).
The algorithms presented will focus on problems related to sorting, stacks, queues, arrays....
Objectives
- 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