why is order of getting a no. of concerned priority is of O(n)
it should be O(n2) say in an unsorted array I have two find third largest element than it shoul be O(3 *n) outer loop three times innerr n times each ,how the instructor says it’s O(n)
Implementations of priority queue
With the post you should provide the timing in the video around which you are facing the problem
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.