mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
feat: Add endlines in hashing/chaining.cpp
(#1559)
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
parent
20f74d4138
commit
d088e290d4
@ -67,10 +67,10 @@ class hash_chain {
|
||||
if (!head[i]) {
|
||||
std::cout << "Key " << i << " is empty" << std::endl;
|
||||
} else {
|
||||
std::cout << "Key " << i << " has values = ";
|
||||
std::cout << "Key " << i << " has values = " << std::endl;
|
||||
temp = head[i];
|
||||
while (temp->next) {
|
||||
std::cout << temp->data << " ";
|
||||
std::cout << temp->data << " " << std::endl;
|
||||
temp = temp->next;
|
||||
}
|
||||
std::cout << temp->data;
|
||||
@ -102,7 +102,7 @@ class hash_chain {
|
||||
std::shared_ptr<Node> temp = head[h];
|
||||
if (!head[h]) {
|
||||
// index does not exist!
|
||||
std::cout << "Element not found";
|
||||
std::cout << "Element not found" << std::endl;
|
||||
return false;
|
||||
}
|
||||
|
||||
@ -110,19 +110,19 @@ class hash_chain {
|
||||
while (temp->data != x && temp->next) temp = temp->next;
|
||||
|
||||
if (temp->next) {
|
||||
std::cout << "Element found";
|
||||
std::cout << "Element found" << std::endl;
|
||||
return true;
|
||||
}
|
||||
|
||||
// implicit else condition
|
||||
// i.e., temp->next == nullptr
|
||||
if (temp->data == x) {
|
||||
std::cout << "Element found";
|
||||
std::cout << "Element found" << std::endl;
|
||||
return true;
|
||||
}
|
||||
|
||||
// further implicit else condition
|
||||
std::cout << "Element not found";
|
||||
std::cout << "Element not found" << std::endl;
|
||||
return false;
|
||||
}
|
||||
};
|
||||
@ -132,7 +132,7 @@ class hash_chain {
|
||||
*/
|
||||
int main() {
|
||||
int c = 0, x = 0, mod = 0, h = 0;
|
||||
std::cout << "Enter the size of Hash Table. = ";
|
||||
std::cout << "Enter the size of Hash Table. = " << std::endl;
|
||||
std::cin >> mod;
|
||||
|
||||
hash_chain mychain(mod);
|
||||
@ -149,22 +149,22 @@ int main() {
|
||||
std::cin >> c;
|
||||
switch (c) {
|
||||
case 1:
|
||||
std::cout << "Enter element to add = ";
|
||||
std::cout << "Enter element to add = " << std::endl;
|
||||
std::cin >> x;
|
||||
h = mychain.hash(x);
|
||||
h = std::abs(h);
|
||||
mychain.add(x, h);
|
||||
break;
|
||||
case 2:
|
||||
std::cout << "Enter element to search = ";
|
||||
std::cout << "Enter element to search = " << std::endl;
|
||||
std::cin >> x;
|
||||
h = mychain.hash(x);
|
||||
mychain.find(x, h);
|
||||
break;
|
||||
case 3:
|
||||
std::cout << "Enter element to generate hash = ";
|
||||
std::cout << "Enter element to generate hash = " << std::endl;
|
||||
std::cin >> x;
|
||||
std::cout << "Hash of " << x << " is = " << mychain.hash(x);
|
||||
std::cout << "Hash of " << x << " is = " << mychain.hash(x) << std::endl;
|
||||
break;
|
||||
case 4:
|
||||
mychain.display();
|
||||
|
Loading…
Reference in New Issue
Block a user