Chaining Algorithm
The Chaining Algorithm is a powerful technique that falls under the umbrella of heuristic search algorithms, often used in optimization and artificial intelligence (AI) applications. The main idea behind the Chaining Algorithm is to break down a complex problem into a series of smaller sub-problems, and subsequently solve these sub-problems in a sequential manner. By connecting or "chaining" the solutions of these sub-problems together, the algorithm can construct an overall solution to the original problem. This method can significantly reduce the computational time and resources required to find a solution, as compared to other search algorithms that attempt to tackle the problem as a whole.
One of the primary advantages of the Chaining Algorithm is its flexibility, as it can be applied to a wide range of problem domains, such as planning, scheduling, and constraint satisfaction problems. The algorithm can be implemented using either forward or backward chaining, depending on the specific requirements of the problem at hand. In forward chaining, the algorithm starts from the initial state and applies a sequence of actions or transformations to reach the desired goal state. In contrast, backward chaining begins at the goal state and works its way back to the initial state by determining the necessary preconditions and actions that must be fulfilled. Both approaches can effectively reduce the search space and lead to efficient problem-solving in various domains, making the Chaining Algorithm a valuable tool in optimization and AI systems.
#include <iostream>
#include <math.h>
using namespace std;
struct Node
{
int data;
struct Node *next;
} * head[100], *curr;
void init()
{
for (int i = 0; i < 100; i++)
head[i] = NULL;
}
void add(int x, int h)
{
struct Node *temp = new Node;
temp->data = x;
temp->next = NULL;
if (!head[h])
{
head[h] = temp;
curr = head[h];
}
else
{
curr = head[h];
while (curr->next)
curr = curr->next;
curr->next = temp;
}
}
void display(int mod)
{
struct Node *temp;
int i;
for (i = 0; i < mod; i++)
{
if (!head[i])
{
cout << "Key " << i << " is empty" << endl;
}
else
{
cout << "Key " << i << " has values = ";
temp = head[i];
while (temp->next)
{
cout << temp->data << " ";
temp = temp->next;
}
cout << temp->data;
cout << endl;
}
}
}
int hash(int x, int mod)
{
return x % mod;
}
void find(int x, int h)
{
struct Node *temp = head[h];
if (!head[h])
{
cout << "Element not found";
return;
}
while (temp->data != x && temp->next)
temp = temp->next;
if (temp->next)
cout << "Element found";
else
{
if (temp->data == x)
cout << "Element found";
else
cout << "Element not found";
}
}
int main(void)
{
init();
int c, x, mod, h;
cout << "Enter the size of Hash Table. = ";
cin >> mod;
bool loop = true;
while (loop)
{
cout << endl;
cout << "PLEASE CHOOSE -" << endl;
cout << "1. Add element." << endl;
cout << "2. Find element." << endl;
cout << "3. Generate Hash." << endl;
cout << "4. Display Hash table." << endl;
cout << "5. Exit." << endl;
cin >> c;
switch (c)
{
case 1:
cout << "Enter element to add = ";
cin >> x;
h = hash(x, mod);
h = fabs(h);
add(x, h);
break;
case 2:
cout << "Enter element to search = ";
cin >> x;
h = hash(x, mod);
find(x, h);
break;
case 3:
cout << "Enter element to generate hash = ";
cin >> x;
cout << "Hash of " << x << " is = " << hash(x, mod);
break;
case 4:
display(mod);
break;
default:
loop = false;
break;
}
cout << endl;
}
/*add(1,&head1);
add(2,&head1);
add(3,&head2);
add(5,&head1);
display(&head1);
display(&head2);*/
return 0;
}
