《计算模型与算法技术教学课件》6-Transform-and-Conquer.pptVIP

* 1.41 lg n = 2 ln n * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Insertion of a New Element into a Heap Insert the new element at last position in heap. Compare it with its parent and, if it violates heap condition,exchange them Continue comparing the new element with nodes up the tree until the heap condition is satisfied Example: Insert key 10 Efficiency: O(log n) * * 6.5 Horner’s Rule and Binary Exponentiation Horner’s Rule For Polynomial Evaluation Given a polynomial of degree n p(x) = anxn + an-1xn-1 + … + a1x + a0 and a specific value of x, find the value