146) The running time of an algorithm T(n), where 'n' is the input size, is given by T(n) = 8T(n/2) + qn, if n>1 Where p,q are constants. The order of this algorithm is
Answer is:
n3
Related Data structures and Algorithms MCQ with Answers
Answer is:
p x (m div 3)
Answer is:
All of these
Explanation:
Sorting is useful for
* report generation
* responding to queries easily
* making searching easier and efficient
Answer is: