CST 370 - Week 2

This week focused on time complexity, and the analysis of recursive and non-recursive algorithms. Algorithm efficiency is said to be represented by three major notations, "Big Oh", "Big Theta" and "Big Omega", which is important in determining the growth order of an algorithm. Part of the readings for this week covered recurrence relation and backward substitution, which is I method I hadn't used before. Essentially, the backward substitution technique finds the recurrence relation and initial condition for the algorithm's basic operation and uses that to  calculate the time efficiency. Personally, what I found the most interesting this week were the puzzles that were posted in the module as well as the puzzle in this week's quiz. It was interesting to use both math and logic in solving these.