a heap is a binary tree where the root is the biggest
so if i get a root where its not the biggest
how to transform recursivly
6
8 4
7
into
8
7 4
6
i know that i need to switch between the root and the biggest sun
but in this example i still need to go the next level down
so how to write that??
Stop spamming the DOS attacking the forums.
I noticed you're posting a lot in just 24 hours.
My advice is that you should psuedo code your program, convert it into logical pieces of code google any stumbling blocks and if you're then lost post.
Don't post at the 1st sign of trouble. put yer mind and resources to work for you 1st.
A hundred Elephants can knock down the walls of a fortress... One diseased rat can kill everyone inside
The root must be exchanged with the larger of its children. Doing so may have caused the exchanged child to lose the heap property, so you re-heapify on that, continuing to go down the tree until you reach a node that does not need to be re-heapified.
Code://try //{ if (a) do { f( b); } while(1); else do { f(!b); } while(1); //}
