7th Slog (WEEK 10)

This week we started to learn time complexity with certain types of algorithms to determine the number of steps they take and have a comparison of runtime. In lecture, Prof.Dan began with the word Anagrams, and then provided two different approach which are permutation approach and signature approach to realize how their total work look like. Then, Big Oh notation was introduced. Contant factors and lower-order terms are not necessary in Big Oh. I felt like Big Oh proof was kinda easy to understand since it was relative to math proofs. However, I still couldn't figure out different types of time efficience.

In addition, it is great that the due date of Exercise 3 have been exteneded to this Sunday night. I did not spend too much time to figure out how to do part A of E3, but part B was tough and I spent so much time in thinking. Hopefully I can get it right today!!