Does it have anything to do with the heap data structure, for example the Buddy blocks implementation, or does it only take the literal English meaning of the word (a big pile)?

I know heap memory is more practical than theoretical, but there's no Stack Exchange for "Practical Computer Science" yet.

  • 6
    $\begingroup$ This might be of your interest stackoverflow.com/q/1699057/58737 $\endgroup$ – Pratik Deoghare Jan 7 '11 at 6:24
  • $\begingroup$ Me bad, this a dup of a dup. I didn't search on SO at all. Someone please close this as such. $\endgroup$ – Geoffrey Zheng Jan 7 '11 at 16:13
  • 1
    $\begingroup$ The answer is available as linked in these comments. Since this really isn't about "theoretical computer science," I'll simply close it as [off topic]. $\endgroup$ – Robert Cartaino Jan 7 '11 at 16:26

I don't think it has anything to do with the data structure. It's just the opposite of the stack, which carefully orders its elements and doesn't allow them to be read or written except at the top.

| cite | improve this answer | |
  • 3
    $\begingroup$ That's where the confusion comes in. The stack memory is exactly a stack data structure, whereas the heap memory has nothing to do with heap ds. $\endgroup$ – Geoffrey Zheng Jan 7 '11 at 16:13

Not the answer you're looking for? Browse other questions tagged or ask your own question.