Storage mechanism using quadratic probing hash keys.
More...
#include <cmath>
#include <iostream>
#include <vector>
|
using | quadratic_probing::Entry = struct Entry |
|
|
int | quadratic_probing::notPresent |
|
std::vector< Entry > | quadratic_probing::table |
|
int | quadratic_probing::totalSize |
|
int | quadratic_probing::tomb = -1 |
|
int | quadratic_probing::size |
|
bool | quadratic_probing::rehashing |
|
Storage mechanism using quadratic probing hash keys.
- Author
- achance6
-
Krishna Vedala
- Note
- The implementation can be optimized by using OOP style.
◆ main()
Main function
- Returns
- None
247 int cmd = 0, hash = 0, key = 0;
248 std::cout <<
"Enter the initial size of Hash Table. = ";
279 if (entry.
key == quadratic_probing::notPresent) {
285 std::cout <<
"Enter element to generate hash = ";