Big-O Notation - Complexity Problems - Problem Set 2

This course didn’t cover the algorithms yet. Is this question relevant here?

Hi Kathir,

You are right that we did not cover algorithms explicitly yet however, there are a couple of lessons in the first chapter that discusses basic algorithm analysis and covers some examples as well. As this is an open-ended question, the learner can think of any such algorithm that has the same best and worst-case time complexities. In the solution review, the learner can see the answers which have some examples of such algorithms as well as which the learner can look up if interested. Consequently, this question can add to the learning.