There's a sort of gaping volcanic hole at the top. Whatever will we do to fix this.

Here is the code for up heapify, right now it is blank.

Osmosis

Down heapify is this notion that we've got.

Put it in.

Soak it through.

My mama crazy.

Follow it.

Any leaf, anything that is a leaf already were done. That's our termination condition.

We can say to build a heap, rooted at this node, make this new heap, make this new heap and then down heapify.

Given what we have build up so far, we can actually use the pieces to build a heap from scratch.

Swamp thing

Now soak it through.

The entire city's flooded, sir.

That seems like the sort of things that a heap would be really good at.

Mobile connectivity in Africa is pervasive.

My mama's a drunk.

Ideas can be absorbed through osmosis.

Men of violence.

What's going on underwater?

Right. We're satisfied everywhere except for between i and its children, and i doesn't have any children.

Okay. After the event, what happens when the guests go home? We might think of something that was very special and we try to hold on to those memories.

We can use it for drinking and agriculture.

No problem.

Feeling sentimental?

I'm just gonna squander it in selfpity.

Actually, I think that's water, eroding the earth.

Notice we didn't use the sort of middle ground at all.

This is sometimes called heap sort. You give it a (L).

Or, if the heap was already full, then the far left.

The idea is that the new element that we're going to insert we stick at the sort of bottom right corner of the heap.

What's the matter with him? What's he talking about? Old Ironsides has sprung a leak.

And we're going to walk in.

They actually export water molecules through.

A rat, taking a trip down memory lane.

Look, if you flood my house, you're dead.

Are you kidding? I'm an adult child of an alcoholic.

We're going to start of at the root, which is node zero and we're going to say, okay, well, to make this into a heap, well first magically make this into a heap and make this into a heap and once we're done then we could do down heapify on this value and everything will be fine.

So 88 gets swap, this is down heapify 88 gets swap with 30 because 30 is the smaller of the children and now that down heapify is completed this whole thing is a heap.

We just run down heapify starting from there. When that's done, we can return.

I've implemented this in the past. It didn't run so fast for me.

Finding the shortest path in a weighted, undirected connected graph took time m times the logarithm of n.

living lamprey eel brain.

Now if I'm adding this to this stuff here, what do you think's going to happen?

I really need to take a hot bath.