Skip to content

Added comment #25

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
anushkachauhan wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Added comment #25

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 4 additions & 3 deletions hash_table.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,7 @@ using namespace std;
#define EXPAND_FACTOR 0.7 // The factor to indicates when it's time to expand the hash table
// The two defines above are used to have a more static hash table which also allows more optimization

// Base class for the Hash Table
// Base class to create the Hash Table
class HashTable {
public:
HashTable() {
Expand Down Expand Up @@ -78,7 +78,7 @@ class HashTable {
}
return false;
}
void display() {
void display() { // to display the hashtable contents
for(int i = 0; i < this->table_size; i++) {
if (hash_table[i] != 0) {
cout<<hash_table[i]<<" ";
Expand All @@ -94,6 +94,7 @@ class HashTable {
// This is the main function for a hash table, it's responsible for generating the hash for the value;
// For easy understading of the process the hash function will be very simple, which also means
// it would be weak and easy to collide
// Hash Function
int hash(int value) {
return (value % this->table_size);
}
Expand Down Expand Up @@ -130,7 +131,7 @@ class HashTable {
int old_table_size = this->table_size;
this->hash_table = new_table;
this->table_size = this->table_size * 2;
memset(this->hash_table, 0, sizeof(int) * STARTING_SIZE);
memset(this->hash_table, 0, sizeof(int) * STARTING_SIZE); // inserting default value 0 to hash table
// Insert all values again, now the position(hash) could have changed because of the new table size
for(int i = 0; i < old_table_size; i++) {
if (old_table[i] != 0) {
Expand Down