Algorithms CS305 - Quiz 2
What is the worst case running time of Binary Search?
O((lg n)2)
O(lg (lg n))
O(n)
O(lg n)
What are the three possible solutions of the recurrence tn - 5tn-1 + 6tn-2 = 0 ?
tn = 0, tn = 2n, tn = 3n
tn = 0, tn = 2n, tn = 4n
tn = 0, tn = 4n, tn = 3n
tn = 0, tn = 2n, tn = 5n
What is the recurrence equation of the following algorithm?
T(n) = T(n-1) + O(1)
T(n) = 2T(n/2) + n
T(n) = T(n/2) + n
T(n) = T(n/2) + O(1)
{"name":"Algorithms CS305 - Quiz 2", "url":"https://www.quiz-maker.com/Q1H3T03","txt":"Name:, Student ID, What is the worst case running time of Binary Search?","img":"https://www.quiz-maker.com/3012/images/ogquiz.png"}