Description: 10.34 (3) known (k1, k2,... KP is a heap, so you can write one
The algorithm of order log(n) is the algorithm of order log (n). , KP, KP + 1)
Adjust to the heap. Try to write the algorithm "from p= 1, one by one",
And discuss the time complexity of building a heap from this method.
File list (Check if you may need any files):
Download