WorksheetsAOA_quiz
Total questions: 7
Worksheet time: 5mins
For what input condition does Insertion Sort run in Θ(n) time?
The worst-case time complexity of Quick Sort is Θ(n²). This happens when:
Pivot is always the median
Array is random
Partition produces sub-arrays of size 0 and n−1 repeatedly
Partition produces two equal halves
The recurrence relation for Binary Search is:
T(n)=T(n/2)+c
The solution of the recurrence is:
O(n)
O(nlogn)
O(1)
O(logn)
Which of the following statements about asymptotic analysis is TRUE?
Asymptotic analysis describes the efficiency of algorithms in terms of their growth rates.
If an algorithm has best-case time complexity, average-case Θ(n log n), and worst-case O(n²), which algorithm fits this description?
If an algorithm has time complexity
T(n)=3n^2+5n+7
Which of the following sorting algorithms is not stable by default?
