Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Heaps

Name: Anonymous 2008-10-22 16:11

Have you ever wondered why everyone creates heaps as arrays? It's because heaps are MP-complete.

Name: Anonymous 2008-10-22 16:16

I implement my heaps with trees.

Name: Anonymous 2008-10-22 16:19

>>2
This is fucking impossible. Post source code please.

Name: Anonymous 2008-10-22 16:31

They're implemented so that all the elements are stored together in memory which improves performance because you have less cache misses.

Name: Anonymous 2008-10-22 16:33

>>3
What do you mean it's impossible? You can use a tree to provide the same interface as an array by sorting on the order of insertion, therefore if you can use an array to implement a heap, you can use a tree.

Name: Anonymous 2008-10-22 16:37

>>4
Fewer cache misses.

Name: Anonymous 2008-10-22 16:50

>>2
Hree or Treap?

Name: Anonymous 2008-10-22 17:06

I implement my hash tables with trees.

Name: Anonymous 2008-10-22 17:22

I implement my trees using hash tables.

Name: Anonymous 2008-10-22 17:56

I implement my hash trieps with skip tables.

Name: Anonymous 2008-10-22 18:24

I implement my functional heaps with skew binomial trees.

Name: Anonymous 2008-10-22 18:32

I just start every program like this:


unsigned char local_storage[1048576*(1024*3)]


and then use that how I want it.

Name: Anonymous 2008-10-22 19:57

I implement my fibonacci skip lists as unbalanced red-black heaps.

Name: ​​​​​​​​​​ 2010-09-09 12:06

Name: Anonymous 2013-09-01 13:26


You still have a limited amount of levequests, once you do all of your allocated amount you have to wait a while, they reset at a rate of 3 every 12 hours. It's a little annoying when going through an already cleared zone and/or levelling crafting.

Name: Anonymous 2013-09-01 14:57


Yukari is so lewd. I worry Tenshi isn't ready for her.

Don't change these.
Name: Email:
Entire Thread Thread List