diff --git a/CMakeDemo/README.md b/CMakeDemo/README.md
index 0fad66e15d79b7df525c36f809e2ff22de064d1a..73f809cb5e5e22093a5f15cf31171d5f0d3b9203 100644
--- a/CMakeDemo/README.md
+++ b/CMakeDemo/README.md
@@ -1,4 +1,3 @@
-
 # Last Exercise
 
 ## Compiler
@@ -80,7 +79,7 @@ You can see more options if you hit `t` while in `ccmake`. Then you can also set
 Take your matrix classes using dynamic memory allocation with or without the `std::unique_ptr` and add a program which copies, moves and destroys your matrix class. Enable the address sanitizer and see if there are any issues with your code! Try to add your test program(s) as new CMake executable(s).
 
 ###  Performance Measurements STL
-Time some of the STL algorithms and containers we used in exercise. Compare different compiler options. A class timer is already in the CMakeDemo directory. Try to add your benchmark(s) as new CMake executable(s).
+Time some of the STL algorithms and containers we used in exercise 10. Compare different compiler options. A class timer is already in the CMakeDemo directory. Try to add your benchmark(s) as new CMake executable(s).
 
 ### Optimize Matrix Multiplication
 There is already a `matmult` application in the CMake directory which measures the runtime of the matrix multiplication. The naive implementation performs rather poorly, try to change that! As a first step you could try to transpose the second matrix, so that you have line-wise access to both matrices during the algorithm. Secondly you could try to implement a blocking strategy (https://en.wikipedia.org/wiki/Loop_nest_optimization) to improve locality and cache reuse.