Create an account
What is a hash function?
A function used to manipulate the key of an element in a list to identify its location in the list. (p648)
What is hashing?
The technique used for ordering and accessing elements in a list in a relatively constant amount of time by manipulating the key to identify its location in the list. (p648)
What is collision?
The condition resulting when two or more keys produce the same hash location. (p650)
What is linear probing?
Resolving a hash collision by sequentially searching a hash table beginning at the location returned by the hash function. (p650)
What is quadratic probing?
Resolving a hash collision by using the rehashing formula (HashValue +- I^2) % array-size, where I is the number of times that the rehash function has been applied. (p656)
What is random probing?
Resolving a hash collision by generating pseudo-random hash values in successive applications of the rehash function. (p656)
What sorting methods have we discussed?
1) Straight selection sort
2) Bubble sort (two versions)
3) Insertion sort
4) Merge Sort
5) Quick Sort
6) Heap Sort
7) Radix Sort
What does sorting mean?
1) The values stored in an array have keys of a type for which relational operators are defined. (We also assume unique keys.)
2) Rearranges the elements into either ascending or descending within the array.
Please allow access to your computer’s microphone to use Voice Recording.
Having trouble? Click here for help.
We can’t access your microphone!
Click the icon above to update your browser permissions and try again
Reload the page to try again!Reload
Press Cmd-0 to reset your zoom
Press Ctrl-0 to reset your zoom
It looks like your browser might be zoomed in or out. Your browser needs to be zoomed to a normal size to record audio.
Please upgrade Flash or install Chrome
to use Voice Recording.
For more help, see our troubleshooting page.
Your microphone is muted
For help fixing this issue, see this FAQ.
Star this term
You can study starred terms together