cover me in ashes

lundi


Really really trivial algorithm question

CS people should be able to answer this within 5 seconds.

Is it possible to create a binary heap structure that has amortized costs for the only two supported operations:

INSERT: O (log n)
EXTRACT-MIN: O (1)

Explain your answer.

posted by ncmhp @ 19.6.06

covermeinashes : a syndicated collective

covermeinashes is:
anodyne. wayward wordsmith latter day aesculapius.
ncmhp. ....
fcs. tormented lover poet bard.

diversions

contrails

Powered by Blogger