Previous Section
 < Free Open Study > 
Next Section


Index

H

Hardware, 3
Hashed list
sequential list compared with, 625
Hash functions, 623, 630
choosing, 633–635
good, 633–635, 643
for locating element in array, 624
Hashing, 622–633, 643
Hash program
with linear probing, 628
Hash table, 628, 629, 633
Hash value, 631, 635, 636
Header nodes, 349, 392
Headers
linked lists with, 348–349
Heaps, 218, 222, 460, 509, 533–546, 579, 609
application level, 536, 542–545
building, 610, 611, 612
containing letters "A" through "J," 534
defined, 533
implementation level, 536–542
logical level, 533–536
other priority queue representations versus, 545–546
sorting with, 612–614
HeapSort, 161, 600, 613
effect of on array, 614
instability with, 618
Heap sort, 588, 609–615
HeapType function, 538, 611
Heap values
in array representation, 538
Height, 458, 459, 477, 504, 610
Hierarchy of objects, 16, 17, 91
Hierarchy of tasks, 15, 91
Higher-level abstraction
and C++ class type, 85–90
High-level design, 2, 33
High-probability ordering, 620–621
Homogeneous quality
with one-dimensional arrays, 77
Honor roll list
with two items, 307
HouseType
testing, 188


Previous Section
 < Free Open Study > 
Next Section
Converted from CHM to HTML with chm2web Pro 2.85 (unicode)