time complexity

Question

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

Comments

take this question for reference. 

https://gateoverflow.in/39557/gate2016-2-15

Answer 1

I am assuming that linked list is unsorted.

Insert - O(1), insert at the beginning of the linked list, total cost= O(sqrtn)

Decrease Key - O(1), assuming that pointer to the node is provided, total cost = O(nlogn)

Find Operation - O(n), total cost = $O(n^2)$

Comments

if list is sorted the n complexity will be O(n^2logn) (By Decrease Key )