Data Structures and Algorithms - Performance Analysis of Algorithms and Recurrences
76. Find a solution to the following recurrence equation T(n) = T(n/2) + n T(1) = 1
77. The recurrence relation T(1) = 2 T(n) = 3T(n/4) + n Has the solution T(n) equal to
for n ≥ 2. Which of the following
statements is true?79. A sorting technique is called stable if
- Option : B
- Explanation : A sorting technique is called stable if it maintains the relative order of occurrence of non distinct elements
