| Jerey D. Smith, Design and analysis of algorithms, PWS-Kent, Boston, 1989. ISBN 0{ 534-91572-8. MR 91h:68002. |
....recursive procedure calls. Some of our algorithms for traversing and constructing data structures are variations on techniques first published twenty or thirty years ago; some special cases might have been in use since the 1950s. They are now standard fare in undergraduate data structures texts [6, 15]. The contribution here is to derive these algorithms through a sequence of correctness preserving program transformations. This exercise may seem at first to be more entertaining than useful, but there are two real practical benefits to the transformation based approach. First, a programmer using ....
Jeffrey D. Smith. Design and Analysis of Algorithms. PWS-KENT, Boston, 1989.
....the tree degenerates) it exhibits an O(n) time complexity for insertion, deletion, and searching operations, where n represents the number of nodes of the tree. The usual solution to address this problem is to use one of the existing balanced data structures, such as red black [7] or AVL trees [24]. The procedure to balance the tree after an insertion or deletion is based on two types of operations: left and right rotations. Figure shows the code to update the min vd fields for the left rotation (the code for the right rotation being similar) Since a rotation clearly takes constant time, ....
J. D. Smith, "Design and Analysis of Algorithms", PWS-KENT Publishing Company, Boston, 1989.
No context found.
Jerey D. Smith, Design and analysis of algorithms, PWS-Kent, Boston, 1989. ISBN 0{ 534-91572-8. MR 91h:68002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC