FAQ: Asymptotic Notation: Conceptual - Big Omega (Ω) and Big O (O)

This community-built FAQ covers the “Big Omega (Ω) and Big O (O)” exercise from the lesson “Asymptotic Notation: Conceptual”.

Paths and Courses
This exercise can be found in the following Codecademy content:

FAQs on the exercise Big Omega (Ω) and Big O (O)

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head here.

Looking for motivation to keep learning? Join our wider discussions.

Learn more about how to use this guide.

Found a bug? Report it!

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

Hi, thanks for the interesting topic.
Out of interest, does it matter that the worse case in the example is also when 12 is in the last index of the list, requiring N loop iterations to find?
My real question is:
Do you need to consider/discuss more than one best or worst case (if there is more than one of either/both)?
Or can you just say that you have identified more than one case as being equally the best/worst and just treat them the same?
Thanks