Week 6-9

    Over these few weeks we continued with proofs. I found the proofs on assignment 2 to be quite challenging but it did help me with getting a better understanding of proofs and coming up with the 'body' for different proofs. Shortly before the second term test we started to learn about counting steps by determining the amount of iterations of loops or lines in the given code. We also starting to learn about Big O and Big Omega. And with that we can determine the upperbound and lowerbound of an algorithm's run-time in the worst case scenario.