Lecture 5: 01/25/2012

Today’s topic was Binomial Heaps. We discussed the homework for next week (I’ll make a separate post for it) and covered a bit on Binary Heaps first.

We looked at makeheap, heapify, insert, delete, findmin, and meld operations and discussed their runtime. The meld operation inspired us to move to Binomial Heaps where we can merge two Binomial heaps quickly.

We talked about bounds for these operations for Binomial Heaps as well but we didn’t prove any of them.

Next time, we will finish up these operations and hopefully move on to Fibonacci Heaps.

You can read more about today’s topic in Kozen Ch. 8.

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