Lecture 6: 01/27/2012

We covered the amortized bounds for the Binomial Heap today. Most of the class was spent talking about amortized analysis and how we can apply it to the insert operation. At the end, we discussed the fact that either the insert or the delete can be chosen to have amortized constant time, but not both. The choice is arbitrary, depending on your application.

Near the end, we also thought about whether the meld operation took amortized constant time, because every tree has been paid for, but one student noted that the NILs do not have a dollar allocated to them, so meld must be O(log n).

Don’t forget to work on the next homework over the weekend.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s