The Art of Computer Programming: Fundamental algorithmsDetails fundamental concepts and techniques of non-numerical analysis in computer programming, and discusses mathematical linguistics, language translation programming and basic, seminumerical, combinatorial, and syntactical algorithms. |
From inside the book
Try this search over all volumes: Global variables 13
Results 1-0 of 0
Contents
Chapter 1Basic Concepts | 1 |
Chapter 2Information Structures | 228 |
Answers to Exercises | 465 |
Copyright | |
2 other sections not shown
Other editions - View all
Common terms and phrases
algorithm ALINK arcs assume AVAIL binary tree binomial binomial coefficients block buffer bytes called CMPA coefficients column coroutine corresponding cycle defined delete denote directed graph doubly linked list elements elevator ENT1 ENTA entry equivalent Eulerian circuit example exercise formula free tree function garbage collection given index register induction INFO input insertion instruction integer jump list head LLINK mathematical matrix method MIXAL node notation operation oriented tree otherwise set output OVERFLOW permutation pointer polynomial positive integers postorder preorder problem proof prove queue real numbers representation RLINK root routine RTAG Section sequence Show simulation stack step storage subroutine subtree tape techniques terminates theorem threaded tree topological sorting traversal tree structure variable vertex vertices word write zero