Algorithms Fundamentals Quiz

What is the time complexity of a linear search algorithm?

• O(log n)

• O(1)

• O(n^2)

• O(n)

Fill in the blank: Bubble sort is an example of a ________ algorithm.

• non-comparison

• comparison-based sorting

• linear

• hashing

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

• Merge sort

• Insertion sort

• Selection sort

• Bubble sort

Explain the concept of efficiency in algorithms with an example.

• Efficiency in algorithms is related to the number of bugs in the code.

• Efficiency in algorithms is measured in terms of smell complexity and taste complexity.

• Efficiency in algorithms is about how well an algorithm uses colors to solve a problem.

• Efficiency in algorithms is about how well an algorithm uses time and space resources to solve a problem. It is measured in terms of time complexity and space complexity.

List two advantages of using binary search over linear search.

• Higher memory usage and increased complexity

• Limited applicability and lack of flexibility

• Slower time complexity and less efficient searching

• Faster time complexity and efficient searching due to dividing the search interval in half.