363 views
0 votes
0 votes

operations on the list in this order  insert, O(n log n) decrease key, O(n) find operations. What is the time complexity of all these operations put together?

O(n)

O(n2)

C O(n2 log n)

D O$(sqrt(n))$

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
1
1 votes
1 votes
1 answer
2
Markzuck asked Jan 6, 2019
492 views
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
0 votes
0 votes
1 answer
4
Markzuck asked Dec 29, 2018
775 views
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c,like cant we take both the recurrance call as combined as both have same parameter?and if not, then ...