Match the List-I with List-II and select the correct answer:
P. T(n) = T(n – 1) + n
Q. T(n) = T logn
R. T(n) = T(n – 1) + 1
S. T(n) = T + 1
3) O(n2 logn)
What is the time complexity of following recurrence relation?
T(1) = 0
What will be the status of the input 14, 12, 90, 34, 23, 67, 35, 337, 87, 156, 389, 278, 92 after 3rd pass on applying Straight two way Merge Sort.
The sorting algorithm which requires least number of swaps in the worst case is
Which of the following is valid BFS of the above graph?