hash functions quick computation random keys non-random keys hashing strings folding hashing efficiency open addressing separate chaining open addressing versus separate chaining hashing and external storage table of file pointers non-full blocks full blocks summary questions experiments programming projects heaps introduction to heaps priority queuesheapsand adts weakly ordered removal insertion not really swapped the heap workshop applet the fill button the change button the remove button the insert button java code for heaps insertion removal key change the array size the heap java program expanding the heap array efficiency of heap operations xv