Algorithm Theory
M. Penttonen, E. Meineche Schmidt, "Algorithm Theory"
448 Pages | PDF | 5.1 Mb
Many data structures for storing collections of elements and executing certain operations on them have been developed. For example, the red-black tree supports the operations insert, delete, and access, among others, and the Fibonacci heap supports such operations as insert, decrease, and extractmin. An element is typically composed of a number of fields, each of which holds a value. Many common operations on collections of elements logically pertain to a specific element among those currently stored. E.g., the task of a delete operation is to remove an element from the collection, and that of a decrease operation is to lower the value of a field of a certain element. Therefore the question arises of how a user of a data structure can refer to a specific element among those present in the data structure.
Download:
 | | |
| Code: http://rapidshare.com/files/223935283/9_2Algorithm_theory.rar | |
| | |
Post a Comment