open navigation menu
AiFolder
Tools for a smarter you
Discover
Tools
AI
Games
Interviews
Blog
More
Search AiFolder
Toggle theme
Toggle theme
Sign in
Exit
00:00
Submit test
Big-O Notation · Advanced
10 questions · Question 1 of 10
10%
Multiple Choice
Entry
What is Big O notation?
A
Big O notation (also called "asymptotic growth" notation) is a relative representation of the complexity of an algorithm.
B
Big O is the upper bound, while Omega is the lower bound.
C
O( 1) time Accessing Array Index ( int a = ARR[5]; ) Inserting a node in Linked List Pushing and Poping on Stack Insertion and Removal from Queue Finding out the parent or left/right child of a node in a tree stored i...
D
If you do an operation say a million times, you don't really care about the worst case or the best case of that operation what you care about is how much time is taken in total when you repeat the operation a million...
Previous
Next