Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Sorting
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all insertions can be accommodated.
1
θ(1), θ(n)
2
θ(n), θ(1)
3
θ(1), θ(1)
4
θ(n), θ(n)