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? A O(n) B O(n2) C O(n2 log n) D O$(sqrt(n))$ Algorithms algorithms time-complexity + – rahul sharma 5 asked Dec 8, 2017 rahul sharma 5 363 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Shivam Chauhan commented Dec 8, 2017 reply Follow Share O($N^2log n$) 0 votes 0 votes rahul sharma 5 commented Dec 8, 2017 reply Follow Share YEs correct. Given answer is $(n^2)$. But for decrease key,we need to find key so c should be correct 0 votes 0 votes Anu007 commented Dec 8, 2017 reply Follow Share rahul i thing question has smthing missing . 1 votes 1 votes commenter commenter commented Nov 2, 2019 reply Follow Share Isn't the answer supposed to be O(nlogn) as we are carrying out operations one after the other? So it must be the function with more asymptotic growth. Ofcourse options B and C also satisfy but tight bound must be O(nlogn). 0 votes 0 votes Please log in or register to add a comment.