Add content to second hands-on

lectures/complexity/slides.qmd

@@ -514,9 +514,9 @@ None
 ## Hands-on Session! {background-color=var(--dark-bg-color) .leftalign}
 
 1. Create an array `x_values` with at least 4000 equally distributed elements ranging from -2.0 to 2.0
-2. Starting from the left end (-2.0), use a binary search to find the highest value $x$ in the array `x_values`,
-   for which $f(x) > 0$
-
+2. Starting from the left end (-2.0), implement a binary search to find the highest value $x$ in the array `x_values`,
+   for which $f(x) > 0$. How many steps and checks are necessary to find $x$?
+3. How many steps would be necessary if `x_values` contained 4100 values? And for 3900?