Interesting week in learning about time complexity. I remember learning Big O notation in the past but wasn't aware of Theta and Omega notation as well! I hadn’t realized before that Big O only tells you the upper bound of an algorithm’s growth rate, while Theta is for tight bounds, and Omega gives you the lower bound. I remember my professor was mostly concern about the worst case scenario. It was a bit challenging to figure out the notation and remember what the math notations mean again. Recursion is a difficult topic to understand and grasp and is something I still struggle with. The idea of a function calling itself makes sense in theory, but when it comes to actually tracing through code, especially with multiple recursive calls. I start to lose track of what’s going on. I tried to do many practice code online using codingbat, which helped but it still hasn't stuck with me. Overall, this week was b...