tags:

views:

21

answers:

0
+1  Q: 

about heap and deleting the i-th item

hi I want to write an algorithm that will delete the i-th item in the heap which has o(logn),also I want to know that the i-th element will be the less one item in the heap or no? is there any site that help me to write this algorithm? please help me thanks

related questions

Does this type of memory get allocated on the heap or the stack?
Stack,Static and Heap in C++
Kind of self-modifying program in C
How to get a heap dump of a Java process on Windows that's not running in a console
C++ Accessing the Heap
Analyze Tomcat Heap in detail on a production System
Increase heap size in j2me
C++ Multi-dimensional Arrays on the Heap
Java: Memory Allocation For Objects
Can I (and do I ever want to) set the maximum heap size in .net?
General Question: Java has the heap and local stack. Can you access any object from the heap?
Efficient heap-manager for heavy churn, tiny allocs?
malloc() and the C/C++ heap
How do I analyze a .hprof file?
How to avoid heap fragmentation?
Local variables with Delegates
Is there a way to dump the objects in memory from a running ruby process?
What is the fastest way (in theory at least) to sort a heap?
Priority queue in .Net
VS2005: Limit the Heap size
What and where are the stack and heap
What runs in a C heap vs a Java heap in HP-UX environment JVMs?
How to deal with "java.lang.OutOfMemoryError: Java heap space" error (64MB heap size)
How to prevent an object being created on the heap?
Of Memory Management, Heap Corruption, and C++