Adding lab 2

README.md

@@ -55,10 +55,6 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
 - Base cases and recursive cases
 - Recursion vs. iteration
 - Tail recursion
-- Lists, Search
-- Introduction to lists (arrays vs. linked lists)
-- Operations on lists (insertion, deletion, traversal)
-- Searching algorithms (linear, binary)
 
 <details>
 <summary>📖 </summary>
@@ -112,7 +108,7 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
 
 - Recursive, independent problem-solving strategy
 - Application to sorting (merge sort, quick sort) and search (binary search)
-- Examples: Fibonacci
+- Fibonacci
 - Knapsack Problem (greedy)
 
 <details>
@@ -131,8 +127,7 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
 
 - Definition and characteristics of dynamic programming
 - Memoization data structures
-- Examples (using dynamic programming): Fibonacci, Knapsack Problem 
-
+- Optimizing Fibonacci, Knapsack Problem using dynamic programming
 
 <details>
 <summary>📖 </summary>
@@ -185,10 +180,10 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
 
 ### Lecture 9 - **Graphs**
 
-   - Introduction to graphs (vertices and edges)
-   - Types of graphs (directed, undirected, weighted, unweighted)
-   - Representing graphs as adjacency matrix, adjacency list
-   - Graph properties (connectivity, cycles)
+ - Introduction to graphs (vertices and edges)
+ - Types of graphs (directed, weighted)
+ - Graphs data structures (adjacency matrix, adjacency list)
+ - Graph properties (connectivity, cycles)
 
 <details>
 <summary>📖 </summary>