Efficiency of Algorithms

What is the time complexity of a linear search algorithm?

• O(n)

• O(n^2)

• O(1)

• O(log n)

Fill in the blank: The efficiency of an algorithm is often measured in terms of its _________.

• execution time

• time complexity or space complexity

• memory usage

• algorithm complexity

Which sorting algorithm has the best-case time complexity of O(n log n)?

• Insertion Sort

• Selection Sort

• Bubble Sort

• Merge Sort

Explain the difference between time complexity and space complexity.

• Time complexity and space complexity are the same concepts.

• Time complexity is related to the amount of time an algorithm takes to run, while space complexity is related to the amount of memory an algorithm uses.

• Time complexity is only relevant for small datasets, while space complexity is only relevant for large datasets.

• Time complexity is related to the amount of memory an algorithm uses, while space complexity is related to the amount of time an algorithm takes to run.

True or False: Bubble sort is an efficient sorting algorithm.

• False

• Depends on the input size

• Partially true

• True

What is the space complexity of a recursive algorithm with O(n) time complexity?

• O(1)

• O(n)

• O(n^2)

• O(log n)

What is the worst-case time complexity of a binary search algorithm?

• O(n)

• O(n^2)

• O(log n)

• O(1)

What is the purpose of Big O notation in analyzing algorithm efficiency?

• To count the number of lines in the algorithm

• To determine the color of the algorithm

• To calculate the weight of the algorithm

• To analyze the time and space complexity of algorithms.

Which data structure is typically used to implement a queue?

• stack

• array or linked list

• binary tree

• hash table

What is the time complexity of a binary search algorithm?

• O(1)

• O(log n)

• O(n)

• O(n^2)