2.5k
views
0 votes
Consider a disk that rotates at 3600 rpm.The seek time to move the head between adjacenttracks is 2 ms. There are 32 sectors per track, which are stored in linear orderfr...
558
views
0 votes
The operation HEAP-DELETE$(A, i)$ deletes the item in node $i$ from heap $A$. Give an implementation of HEAP-DELETE that runs in $O(lg\ n)$ time for an $n-$element max-h...