In computer science, a HEAP is known as…

Posted: May 10, 2008 by ralliart12 in academia, ScratchPad
Tags: , , , ,

From Wiki (quoted word for word)

In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if B is a child node of A, then key(A) ≥ key(B). This implies that an element with the greatest key is always in the root node, and so such a heap is sometimes called a max heap. (Alternatively, if the comparison is reversed, the smallest element is always in the root node, which results in a min heap.) This is why heaps are used to implement priority queues. The efficiency of heap operations is crucial in several graph algorithms.

So I guess as you can see from this next photo, I’m implementing an abstract data structure!

This probably isn’t funny if you’re not a com science student. But then again, com science students dun have a sense of humour…wait a min, doesn’t that make me a missing link!?!?!?!

Advertisements
Comments
  1. rqpy dysz wcahxrlbd zdihn ywzkabgrf ifmjcasvo wgdqo

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