What is the main feature of quadratic probing?
1) If an item is not found, other locations are checked in steps that grow as the square of the attempt number (1, 4, 9, 16, etc). A second hash function is used to determine the step size in case of collision. If a collision occurs, the item is added to the bucket, evicting the old item.
2) Substrings found at every position on the text T are hashed, and collisions are kept in a chaining list. A search for a string S is conducted at all buckets of the hash table. The search string S is preprocessed instead of the text T.
3) The Find operation proceeds up from a leaf until reaching a self-pointing node. The Union operations invokes Find once and swaps the root and the leaf. Path compression makes each visited node point to its grandchild.
4) Pick any node; if its degree is 1, traverse to a neighbor node. Consider the node you end up with. If its degree is not n-1, return false, else check that all its neighbors have degree 1: if so, return true, else return false. Pick any node; if its degree is n-1, traverse to a neighbor node. Consider the node you end up with. If its degree is not 1, return true, else check that all its neighbors have degree n-1: if so, return true, else return false. Pick any node; if its degree is 3, traverse to a neighbor node. Consider the node you end up with. If its degree is not n-1, return false, else check that all its neighbors have degree 3: if so, return true, else return false. Pick any node; if its degree is n-3, traverse to a neighbor node. Consider the node you end up with. If its degree is not n-3, return true, else check that all its neighbors have degree 3: if so, return false, else return true.