Mastering Big O Notation Quiz

What does Big O Notation primarily describe in computer science?

• The amount of memory an algorithm uses

• The time complexity of an algorithm

• The number of lines of code in an algorithm

• The programming language used

Which of the following time complexities is considered the most efficient?

• It remains the same

• It doubles

• It quadruples

• It triples

Which of the following is an example of a logarithmic time complexity?

• Binary search

• Linear search

• Bubble sort

• Insertion sort

What is the time complexity of the Merge Sort algorithm?

Which of the following best describes the time complexity of finding an element in a balanced binary search tree?

• Sorting

• Searching

• Combinatorial

• Graph traversal

Which of the following time complexities is considered the least efficient?

What is the time complexity of accessing an element in an array by index?

• Quick Sort

• Merge Sort

• Bubble Sort

• Binary Search