This week I learned more about asymptotic notations. I had previously only heard of Big Oh notation, and it was interesting to know that there were two other notations, namely Big Theta and Big Omega. I feel like I have some understanding of how these notations are used to describe an algorithm's efficiency, but I know I will need to review and use these concepts to really cement them into memory.
I also learned how to analyze an algorithm's efficiency for recursive and non-recursive algorithms. For the non-recursive algorithms the process is relatively straightforward. For recursive algorithms, I learned about a process called the "backward substitution" method. I did struggle with this concept and feel that I need to review it in the coming weeks to ensure I understand the material. Overall, I would say this week introduced several challenging topics that I will need to study and review.
Comments
Post a Comment