1.) The Big O notation is a theoretical approach for analyzing the performance of an algorithm. It estimates how fast an algorithms execution time increases as the input size increases.

Group of answer choices

True

False

2. Linear search takes O(n) time. An algorithm with the O(n) time complexity is called a linear algorithm

True

False

3.) If the worst-time complexity for selection sort and insertion sort is O (log2) , an algorithm with the O(log2) time complexity is called a log-squared algorithm

Group of answer choices

True

False