hashing explicit hashtableint size arraynextprimesize makeempty)void makeemptycurrentsize forauto entry array entry info emptyfigure routines to initialize quadratic probing hash table bool containsconst hashedobj const return isactivefindposx )int findposconst hashedobj const int offset int currentpos myhashx )whilearraycurrentpos info !empty &arraycurrentpos element ! currentpos +offset/compute ith probe offset + ifcurrentpos >array sizecurrentpos -array size)return currentposbool isactiveint currentpos const return arraycurrentpos info =activefigure contains routine (and private helpersfor hashing with quadratic probing if the new location is past the arrayit can be put back in range by subtracting tablesize this is faster than the obvious methodbecause it avoids the multiplication and division that seem to be required an important warningthe order of testing at lines and is important don' switch itthe final routine is insertion as with separate chaining hashingwe do nothing if is already present it is simple modification to do something else otherwisewe place it at the spot suggested by the findpos routine the code is shown in figure if the load