Loading the lesson
Loading the lesson
Search AllRounder.ai
Search the courses, subjects, tracks, games and features, or jump straight to a page.
Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
What does big O notation represent?
Think about maximum limits for algorithm performance.
What is theta notation?
Consider it as both upper and lower bounds together.
What describes the upper bound of an algorithm?
Think of it as a cap on performance.
n³ is big O of n². True or False?
Consider how both expressions scale.
Prove that log(n) is Θ(log(n)).
Examine the expressions at limits.
Show that the function f(n) = n⁴ + 10n² is Θ(n⁴).
Revisit dominant terms.
5 more questions in this section. Enroll free to practise them all.
Enroll free