correct typos

README.md

@@ -102,7 +102,7 @@ zip -r project.zip . -x "venv/**" ".git/**"
 
 ## Binary search [[toc](#table-of-content)]
 Let's start this class with a quite simple problem: given a list $l$ of $n$
-integers and an integer $i$, how can you tell whether or not $i$ is $l$?
+integers and an integer $i$, how can you tell whether or not $i$ is in $l$?
 
 :gear: You can run `make test`. You should have 14 failing tests, that's
 normal you will complete your code base and make sure the tests pass during the
@@ -114,7 +114,7 @@ class.
 :pencil: Can you solve the question above with the list below?
 ```python
 from random import randint
-l = [randint(1_000_000) for _ in range(1000)]
+l = [randint(1, 1_000_000) for _ in range(1000)]
 ```
 
 :question: What is the complexity of your algorithm?