Q233
What is the time complexity of for achieving competitive ratio by tango tree?
A.
O (log n)
B.
O (n2)
C.
O (n!)
D.
O (log (log n))
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board