updated outline with boks

README.md

 # UE5 Fundamentals of Algorithms
 
 Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
+
+## Course Description
+
+- Basis of algorithms (sorting, search) and data structure (arrays, lists)
+- Justification of the choice of data structures
+- Calculate the complexity of an algorithm
+- Optimize algorithms
+- Writing programs using algorithms
+
+
+
+## Outline
+
+📖 == expected reading beforet the class day
+
+1. **Data structures and complexity** - [notebook](01-introduction.ipynb), [slides (pdf)](01-introduction.ipynb)
+
+- 📖 [Python for Everybody](pythonlearn.pdf) chapter 8 (lists), 9 (dictionnaries), 10 (tuples)
+
+2. **Recursion** - [notebook](02-recursion.ipynb), [slides (pdf)](02-recursion.ipynb)
+
+- 📖 [Think Python](thinkpython2.pdf) chapter 5 (Conditionals and recursion))
+
+3. **Stacks and Queues**
+
+4. **Sorting**
+
+5. **Hashing**
+
+6. **Trees**
+
+7. **Trees and their representation**
+
+8. **Tree Algorithms**
+
+9. **Binary and n-trees**
+
+10. **Graphs**
+
+11. **Divide and conquer Programming**
+
+12. **Dynamic Programming**
+
+13. **Greedy Algorithms**
+
+14. **Graphs shortest path algorithm**
\ No newline at end of file