Alg2

After an introdution to complexity, we teaching the main search and sort algorithms, showing the data structures and the associated complexity. The outline of the course is:

1. Introduction to algorithm complexity
2. Search
   
• research in lists (sequential, dichotomic)
• search binary trees
• balanced trees, AVL, 2-3 trees, two-colored trees
• hash-code
  
3. Internal Sort: insertion, selection, quick sort, heap sort
4. External Sort

TP1 : calcul de complexités

TP2 : listes auto-adaptatives

TP3 : adjonction aux feuilles d'un Abr

TP4 : arbres AVL

TP6 : tri fusion