What is the primary purpose of performance analysis in software development?

To ensure user friendliness, modularity, security, and maintainability by focusing on performance.

True or False: Asymptotic Analysis measures the actual running time of an algorithm.

False. Asymptotic Analysis evaluates performance based on input size, not actual running time.

Riddle: I grow logarithmically with input size in searching, but require sorting first. What am I?

Binary Search

Fill in the blank: The time complexity of Merge Sort is ______.

Θ(n log n)

Which of the following statements about Big O notation is true? A) It provides a tight upper bound. B) It only represents lower bounds. C) It can be used for any function. D) It does not consider constant factors.

A) It provides a tight upper bound.

What is the worst-case time complexity of Linear Search?

Θ(n)

True or False: The best case time complexity of Insertion Sort is Θ(n²).

False. The best case time complexity of Insertion Sort is Θ(n).

Fill in the blank: The Master Method is applicable for recurrences of the form T(n) = aT(n/b) + ______.

F(n)

Riddle: I'm known for my divide and conquer strategy and have a consistent time complexity in all cases. What am I?

Merge Sort

What is the role of Amortized Analysis in algorithm performance?

It analyzes a sequence of operations to guarantee average time complexity that is lower than the worst-case time of any particular operation.