Log Five

I find that trying to prove the time complexity of algorithms is a lot harder to do than the previous types of proofs from the lectures. Getting used to the different styles and uses of notations within the proof statements is one issue, although that problem seems to be easily fixed with more practice. The main problem is not the structure of the proof, but the actual proof itself. Utilizing sequences to simplify certain steps looks to be the best method for all the algorithms shown up until now, but how this can be applied to reach the implication is still something that I'm not used to. A lot more practice in this area seems to be needed until I'm comfortable enough to do these types of questions.