diff --git a/m411/README.md b/m411/README.md
index af3f4e4..7e9f7b4 100644
--- a/m411/README.md
+++ b/m411/README.md
@@ -10,9 +10,9 @@
 | ---- | ------                         | --------------         |
 |  (1)  25.11.21| [First steps](./1)             | Modulvorstellung <br>- what is an algorithm <br>- what are data structures <br>-first steps I (classes, main-methode)|
 |  (2)  02.12.21| [file handling](./2)           | first steps II / reading user input (scanner) / reading and writing files (BufferedReader) |
-|  (3)  09.12.21| [Linked Lists, Arrays](./3)            | follow up arrays   <br>working with arrays <br> - fill, search, update, delete array elements <br> - sorting (BubbleSort)  <br> linked lists (self made) |
-|  (4)  16.12.21| [Arrays, (Bubble)Sort, Stack, Queue, RuntimeBehaviour](./4)      | compare sort-algorithms <br> - BubbleSort vs QuickSort <br> - BubbleSort vs ??Sort <br> incl. mesurement the speed <br> - stack (push, pop) and queues (FIFO, LIFO, LILO, FILO) |
-|  (5)  06.01.22| [Hashmaps, Recursions](./5)    | - hash maps, <br>- recursions , back tracking  |
+|  (3)  09.12.21| [Linked Lists, Arrays](./3)            | follow up arrays   <br>working with arrays <br> - fill, search, update, delete array elements <br> linked lists (self made) |
+|  (4)  16.12.21| [Arrays, (Bubble)Sort, Stack, Queue, RuntimeBehaviour](./4)      |  - sorting (BubbleSort)  <br> - compare sort-algorithms <br> - BubbleSort vs QuickSort <br> - BubbleSort vs ??Sort <br> - stack (push, pop) and queues (FIFO, LIFO, LILO, FILO) |
+|  (5)  06.01.22| [Hashmaps, Recursions](./5)    | - hash maps, <br>- recursions , back tracking <br> - mesurement the speed (runtime behaviour)<br> |
 |  (6)  13.01.22| **LB1** (30% MN) <br>- 30 min on paper and<br>- 60 min coding <br> themes: arrays, stacks, sorts, linked lists |  - follow up [hash maps, recursions](./5) <br>- [collections](./6)                      |
 |  (7)  20.01.22| **LB2** (30% MN) <br>- 30 min on paper and<br>- 60 min coding <br> themes: hash maps and rekursions | after LB2 start mini project (LB3),<br>find a team partner and find a [problem to solve]((./docs/Unterlagen_LB3_MiniProjekte))<br>- [trees and graphs](./7) <br>- [Dijkstra-Algorithm (route planner)](./7)  <br>- [xml data, json data](./7) <br>- [page rank algorithm](./7) |
 |  (8)  27.01.22| __Start__ **LB3** (40% MN) <br> start mini project <br> team of 2 persons | - search and [decide a  mini-projekt](./docs/Unterlagen_LB3_MiniProjekte) <br>- work on mini project |