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)

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters