From 011f307279f18ddbcdbd48f71f0d6ac2ff418333 Mon Sep 17 00:00:00 2001
From: farhan <farhanasfar21@gmail.com>
Date: Wed, 18 Jan 2023 00:40:55 +0600
Subject: [PATCH 1/3] added A-star Search code

---
 algorithms/artificial-intelligence/astar.cpp | 172 +++++++++++++++++++
 1 file changed, 172 insertions(+)
 create mode 100644 algorithms/artificial-intelligence/astar.cpp

diff --git a/algorithms/artificial-intelligence/astar.cpp b/algorithms/artificial-intelligence/astar.cpp
new file mode 100644
index 00000000..d94d6c3d
--- /dev/null
+++ b/algorithms/artificial-intelligence/astar.cpp
@@ -0,0 +1,172 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+struct myQueue{
+    int x, y;
+    double g, h, f ;
+    bool flag ;
+}Q[100], temp,par[100][100];
+
+
+int grid[100][100] ;
+double heuristicCost[100][100], dis[100][100] ;
+
+void initialization(int n, int m, int stri, int strj)
+{
+    int k = 0 ;
+    dis[stri][strj] = 0.0 ;
+    for(int i = 0 ; i < n ; i++){
+        for(int j = 0 ; j < m ; j++){
+            Q[k].x = i ;
+            Q[k].y = j ;
+            Q[k].g = dis[i][j] ;
+            Q[k].h = heuristicCost[i][j] ;
+            Q[k].f = Q[k].g + Q[k].h ;
+            Q[k].flag = true ;
+            k++ ;
+        }
+    }
+}
+
+bool isEmpty(int n, int m){
+    for(int i = 0 ; i < n*m ; i++){
+        if(Q[i].flag)
+		return false ;
+    }
+    return true ;
+}
+
+int pop(int n, int m)
+{
+    int min = 1000000 ;
+    int index ;
+    for(int i = 0 ; i < n*m ; i++)
+    {
+        if(Q[i].f < min && Q[i].flag == true){
+            min = Q[i].f ;
+            index = i ;
+        }
+    }
+    Q[index].flag = false ;
+    return index ;
+}
+
+void updateQueueCost(int i, int j, double cost, int n, int m){
+    for(int k = 0 ; k < n*m ; k++){
+        if(Q[k].x == i && Q[k].y == j){
+            Q[k].g = cost ;
+            Q[k].f = Q[k].g + Q[k].h ;
+        }
+    }
+}
+void aStarSearch(int n, int m)
+{
+    while(!isEmpty(n, m)){
+        int index = pop(n,m) ;
+        temp = Q[index] ;
+        int i = temp.x ;
+        int j = temp.y ;
+        if(grid[i-1][j] > -1){
+            if(dis[i-1][j] > dis[i][j] + grid[i-1][j]){
+                dis[i-1][j] = dis[i][j] + grid[i-1][j];
+                par[i-1][j].x = i;
+                par[i-1][j].y = j;
+                updateQueueCost(i-1, j, dis[i-1][j], n, m);
+            }
+        }
+
+        if(grid[i+1][j]>-1){
+            if(dis[i+1][j] > dis[i][j]+grid[i+1][j]){
+                dis[i+1][j] = dis[i][j] + grid[i+1][j];
+                par[i+1][j].x = i;
+                par[i+1][j].y = j;
+                updateQueueCost(i+1, j, dis[i+1][j], n, m);
+                cout<<"i,j: "<<i<<","<<j<<"\n";
+            }
+        }
+
+        if(grid[i][j-1]>-1){
+            if(dis[i][j-1] > dis[i][j]+grid[i][j-1]){
+                dis[i][j-1] = dis[i][j]+grid[i][j-1];
+                par[i][j-1].x = i;
+                par[i][j-1].y = j;
+                updateQueueCost(i, j-1, dis[i][j-1], n, m);
+                cout<<"i,j: "<<i<<","<<j<<"\n";
+            }
+        }
+        if(grid[i][j+1]>-1){
+            if(dis[i][j+1] > dis[i][j]+grid[i][j+1]){
+                dis[i][j+1] = dis[i][j]+grid[i][j+1];
+                par[i][j+1].x = i;
+                par[i][j+1].y = j;
+                updateQueueCost(i, j+1, dis[i][j+1], n, m);
+                cout<<"i,j: "<<i<<","<<j<<"\n";
+            }
+        }
+    }
+
+}
+
+int main()
+{
+    int n, m, i , j ;
+    int stri, strj, dsti, dstj ;
+    scanf("%d %d", &n, &m) ;
+    for(i = 0 ; i < n ; i++){
+        for(j = 0 ; j < m ; j++){
+            scanf("%d", &grid[i][j]) ;
+
+        }
+    }
+    scanf("%d %d %d %d", &stri, &strj, &dsti, &dstj) ;
+    for(i = 0 ; i < n ; i++){
+        for(j = 0 ; j < m ; j++){
+            heuristicCost[i][j] = sqrt(pow((1.00*dsti-i),2)+pow((1.00*dstj-j),2)) ;//destination between starting and destination node
+            dis[i][j] = 99999.00 ;
+        }
+    }
+    /*for(i = 0 ; i < n ; i++){
+        for(j = 0 ; j < m ; j++){
+            printf("%.3lf ", heuristicCost[i][j]) ;
+        }
+        printf("\n") ;
+    }*/
+    initialization(n, m, stri, strj) ;
+    aStarSearch(n, m) ;
+    cout<<endl;
+    for(int i=0; i<n; i++)
+    {
+        for(int j=0; j<m; j++)
+        {
+            cout<<dis[i][j]<<" ";
+        }
+        cout<<"\n";
+    }
+    cout<<"\n\n";
+
+    while(par[dsti][dstj].x != stri || par[dsti][dstj].y!=strj){
+        cout<<"("<<dsti<<","<<dstj<<")<--";
+        dsti = par[dsti][dstj].x;
+        dstj = par[dsti][dstj].y;
+    }cout<<"("<<stri<<", "<<strj<<")";
+    /*for(int i=0; i<n; i++)
+    {
+        for(int j=0; j<m; j++)
+        {
+            cout<<par[i][j].x<<","<<par[i][j].y<<" ";
+        }
+        cout<<"\n";
+    }*/
+
+
+}
+/*
+4 4
+2 5 3 4
+-1 1 7 3
+4 2 6 8
+5 2 1 3
+0 0
+3 3
+*/
+

From 010f6360174171feef3b88ba059d498988f0a61e Mon Sep 17 00:00:00 2001
From: farhan <farhanasfar21@gmail.com>
Date: Sun, 22 Jan 2023 23:18:16 +0600
Subject: [PATCH 2/3] added code and data file for NaiveBayesian algorithm

---
 .../Naive Bayesian/NaiveBay.txt               |  10 +
 .../Naive Bayesian/NaiveBayesian.cpp          | 269 ++++++++++++++++++
 .../Naive Bayesian/naiveBayTest.txt           |   3 +
 .../Naive Bayesian/naiveBayTesting.cpp        | 214 ++++++++++++++
 4 files changed, 496 insertions(+)
 create mode 100644 algorithms/artificial-intelligence/Naive Bayesian/NaiveBay.txt
 create mode 100644 algorithms/artificial-intelligence/Naive Bayesian/NaiveBayesian.cpp
 create mode 100644 algorithms/artificial-intelligence/Naive Bayesian/naiveBayTest.txt
 create mode 100644 algorithms/artificial-intelligence/Naive Bayesian/naiveBayTesting.cpp

diff --git a/algorithms/artificial-intelligence/Naive Bayesian/NaiveBay.txt b/algorithms/artificial-intelligence/Naive Bayesian/NaiveBay.txt
new file mode 100644
index 00000000..9a8e4416
--- /dev/null
+++ b/algorithms/artificial-intelligence/Naive Bayesian/NaiveBay.txt	
@@ -0,0 +1,10 @@
+yes	single		125	no
+no	married 	100	no
+no	single		70	no
+yes	married		120	no
+no	divorced	95	yes
+no	married		60	no
+yes	divorced	220	no
+no	single		85 	yes
+no	married 	75 	no
+no	single		90 	yes
\ No newline at end of file
diff --git a/algorithms/artificial-intelligence/Naive Bayesian/NaiveBayesian.cpp b/algorithms/artificial-intelligence/Naive Bayesian/NaiveBayesian.cpp
new file mode 100644
index 00000000..0e0455a7
--- /dev/null
+++ b/algorithms/artificial-intelligence/Naive Bayesian/NaiveBayesian.cpp	
@@ -0,0 +1,269 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include<string.h>
+#include<vector>
+#include<bits/stdc++.h>
+#include<iostream>
+using namespace std;
+
+vector<string>Rvalue;
+vector<string>Mvalue;
+vector<string>Tvalue;
+vector<string>Evade;
+vector<int>tax;
+
+int numberofobject = 0;
+double priorY=0, priorN=0;
+
+int findOccurance(string att, string cl)
+{
+    FILE *fptr;
+    char r[100], m[100], t[100], e[100];
+    int count = 0 ;
+    if ((fptr = fopen("NaiveBay.txt", "r")) == NULL) {
+        printf("Error! opening file");
+        exit(1);
+    }
+    while (fscanf(fptr, "%s %s %s %s", r, m, t, e)!= EOF){
+        string s1 = "" ;
+        string s2 = "" ;
+        string s3 = "" ;
+        string s4 = "" ;
+
+        for(int i = 0 ; i < strlen(r) ; i++){
+            s1 += r[i] ;
+         }
+         for(int i = 0 ; i < strlen(m) ; i++){
+            s2 += m[i] ;
+         }
+
+         for(int i = 0 ; i < strlen(t) ; i++){
+            s3 += t[i] ;
+         }
+         //n = std::stoi(s3);
+
+         for(int i = 0 ; i < strlen(e) ; i++){
+            s4 += e[i] ;
+         }
+         if(s1 == att && s4 == cl) count++ ;
+         if(s2 == att && s4 == cl) count++ ;
+    }
+    fclose(fptr);
+    return count ;
+}
+
+int main() {
+    char r[100], m[100], t[100], e[100];
+    FILE *fptr;
+    if ((fptr = fopen("NaiveBay.txt", "r")) == NULL){
+        printf("Error! opening file");
+        exit(1);
+    }
+    string s = "" ;
+
+    int yes=0, no=0;
+
+    while (fscanf(fptr, "%s %s %s %s", r, m, t, e)!= EOF){
+        //printf("%s %s", a, c);
+        //printf("\n") ;
+        numberofobject++ ;
+
+        bool flag = false ; //Refund
+        string s = "" ;
+        for(int i = 0 ; i < strlen(r) ; i++)
+        {
+            s += r[i] ;
+        }
+        for(int i = 0 ; i < Rvalue.size() ; i++)
+        {
+            if(s == Rvalue[i])
+            {
+                flag = true ;
+            }
+        }
+        if(!flag)
+            Rvalue.push_back(s);
+
+
+        flag = false ; //Marital status
+        s = "" ;
+        for(int i = 0 ; i < strlen(m) ; i++)
+        {
+            s += m[i] ;
+        }
+        for(int i = 0 ; i < Mvalue.size() ; i++)
+        {
+            if(s == Mvalue[i])
+            {
+                flag = true ;
+            }
+        }
+        if(!flag)
+            Mvalue.push_back(s);
+
+        s = "";
+        for(int i=0; i<strlen(t); i++){
+            s+=t[i];
+        }
+        int n = std::stoi(s);
+        tax.push_back(n); //storing 'taxable income' in a vector.
+
+
+        flag = false ; //Evade
+        s = "" ;
+        for(int i = 0 ; i < strlen(e) ; i++)
+        {
+            s += e[i] ;
+        }
+        for(int i = 0 ; i < Evade.size() ; i++)
+        {
+            if(s == Evade[i])
+            {
+                flag = true ;
+            }
+        }
+        if(!flag)
+            Evade.push_back(s);
+
+        //counting number of yes and no's.
+        if(s=="yes")
+        {
+            yes++;
+        }
+        if(s=="no")
+        {
+            no++;
+        }
+    }
+
+    printf("%d\n\n", numberofobject) ;
+    for(int i = 0 ; i < Rvalue.size() ; i++){
+        cout<< Rvalue[i] << endl ;
+    }
+    cout<<endl;
+    for(int i = 0 ; i < Mvalue.size() ; i++){
+        cout<< Mvalue[i] << endl ;
+    }
+    cout<<endl;
+    for(int i = 0 ; i < Evade.size() ; i++){
+        cout<< Evade[i] << endl ;
+    }
+    cout<<endl;
+
+
+    ofstream myfile("refundhood.txt"); //likelihood for refund.
+    cout<<"Refundhood\n"<<"-----------\n";
+    for(int i = 0 ; i < Evade.size() ; i++){
+        for(int j = 0 ; j < Rvalue.size() ; j++){
+            int n = findOccurance(Rvalue[j], Evade[i]);
+
+            cout<< Rvalue[j] <<"|"<< Evade[i] << " = "<< n << "\t\t";
+
+            //calculating likelihood for refund
+            double likeR=0, likeE=0;
+            if(Evade[i]=="yes"){
+                likeR = (n*1.00)/yes;
+
+                myfile<<Rvalue[j]<<"\t\t"<<Evade[i]<<"\t"<<likeR<<"\n";
+                cout<<likeR<<endl;
+            }
+            else{
+                likeE = (n*1.00)/no;
+
+                myfile<<Rvalue[j]<<"\t\t"<<Evade[i]<<"\t"<<likeE<<"\n";
+                cout<<likeE<<endl;
+            }
+        }
+    }
+    cout<<"\n\n";
+
+
+    cout<<"Maritalhood\n"<<"-----------\n";
+    ofstream myfileM("maritalhood.txt");
+    for(int i = 0 ; i < Evade.size() ; i++){
+        for(int j = 0 ; j < Mvalue.size() ; j++){
+            int n = findOccurance(Mvalue[j], Evade[i]);
+
+            cout << Mvalue[j] <<"|"<< Evade[i] << "= "<< n <<"\t\t";
+
+            //calculating likelihood for marital status
+            double likeR=0, likeE=0;
+            if(Evade[i]=="yes"){
+                likeR = (n*1.00)/yes;
+
+                myfileM<<Mvalue[j]<<"\t\t"<<Evade[i]<<"\t\t"<<likeR<<"\n";
+                cout<<likeR<<endl;
+            }
+            else{
+                likeE = (n*1.00)/no;
+
+                myfileM<<Mvalue[j]<<"\t\t"<<Evade[i]<<"\t\t"<<likeE<<"\n";
+                cout<<likeE<<endl;
+            }
+        }
+    }
+    cout<<"\n\n";
+
+
+    ofstream myfiletax("taxhood.txt");
+    cout<<"Taxhood\n"<<"----------\n";
+    double sum = 0;
+    for(int i=0; i<tax.size(); i++)
+    {
+        sum +=tax[i];
+    }
+    double likeT = 0;
+    for(int i=0;i<Evade.size();i++){
+        for(int j=0;j<tax.size();j++){
+            //int n = findOccurance(Tvalue[j], Evade[i]);
+            cout << tax[j] <<"|"<< Evade[i] << "="<<"\t\t";
+
+            double likeR=0, likeE=0;
+            if(Evade[i]=="yes"){
+                likeR = (tax[j]*1.00)/(sum*yes);
+                myfiletax<<tax[j]<<"\t\t"<<Evade[i]<<"\t\t"<<likeR<<"\n";
+                cout<<likeR<<"\n";
+            }
+            else{
+                likeE = (tax[j]*1.00)/(sum*no);
+                myfiletax<<tax[j]<<"\t\t"<<Evade[i]<<"\t\t"<<likeE<<"\n";
+                cout<<likeE<<"\n";
+            }
+        }
+    }
+    cout<<"\n\n";
+
+    /*
+    for(int i=0; i<tax.size(); i++)
+    {
+        likeT = (tax[i]/sum)*1.00;
+        cout<<tax[i]<<"\t"<<likeT<<"\n";
+        myfiletax<<tax[i]<<"\t"<<likeT<<"\n";
+    }
+    //cout<<"\n"<<"Sum: "<<sum<<"\n";
+    cout<<"\n\n";*/
+
+
+    ofstream myfilePrior("priorhood.txt");
+    priorY = (yes*1.00)/numberofobject;
+    priorN = (no*1.00)/numberofobject;
+    myfilePrior<<"Yes "<<priorY<<"\n";
+    myfilePrior<<"No  "<<priorN<<"\n";
+    cout<<"Prior(Yes): "<<priorY<<"\n"<<"Prior(No) : "<<priorN<<"\n\n";
+
+
+
+    fclose(fptr);
+
+    /*string myText;
+    ifstream readFile("refundhood.txt");
+
+    while (getline (readFile, myText)){
+        cout << myText<<"\n";
+    }
+    readFile.close();*/
+
+    return 0;
+}
+
+
diff --git a/algorithms/artificial-intelligence/Naive Bayesian/naiveBayTest.txt b/algorithms/artificial-intelligence/Naive Bayesian/naiveBayTest.txt
new file mode 100644
index 00000000..af76b1c2
--- /dev/null
+++ b/algorithms/artificial-intelligence/Naive Bayesian/naiveBayTest.txt	
@@ -0,0 +1,3 @@
+no married 120
+//no single 70
+//yes divorced 220 [use one input at a time]
\ No newline at end of file
diff --git a/algorithms/artificial-intelligence/Naive Bayesian/naiveBayTesting.cpp b/algorithms/artificial-intelligence/Naive Bayesian/naiveBayTesting.cpp
new file mode 100644
index 00000000..f8e07e2b
--- /dev/null
+++ b/algorithms/artificial-intelligence/Naive Bayesian/naiveBayTesting.cpp	
@@ -0,0 +1,214 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    vector<string>refund;
+    vector<string>marital;
+    vector<string>income;
+
+    //reading testing file.
+    FILE *fptr;
+	if ((fptr = fopen("naiveBayTest.txt", "r")) == NULL) {
+        printf("Error! opening file");
+        exit(1);
+    }
+
+	char r[100], m[100], in[100];
+
+	while(fscanf(fptr, "%s %s %s", r, m, in)!=EOF){
+		string s1="";
+		string s2="";
+		string s3="";
+
+		for(int i=0; i<strlen(r); i++){
+            s1 += r[i] ;
+        }
+        refund.push_back(s1);
+
+		for(int i=0; i<strlen(m); i++){
+            s2 += m[i] ;
+        }
+        marital.push_back(s2);
+
+		for(int i=0; i<strlen(in); i++){
+            s3 += in[i] ;
+        }
+        income.push_back(s3);
+	}   //done storing data of Testing file.
+	fclose(fptr);
+
+	//for refund likelihood.
+	vector<string>refund1;
+	vector<string>evade1;
+	vector<string>refhood;
+
+	if ((fptr = fopen("refundhood.txt", "r")) == NULL) {
+        printf("Error! opening file");
+        exit(1);
+    }
+
+	char r1[100], e1[100], ref1[100];
+
+	while(fscanf(fptr, "%s %s %s", r1, e1, ref1)!=EOF){
+		string s1="";
+		string s2="";
+		string s3="";
+
+		for(int i=0; i<strlen(r1); i++){
+            s1 += r1[i] ;
+        }
+        refund1.push_back(s1);
+
+		for(int i=0; i<strlen(e1); i++){
+            s2 += e1[i] ;
+        }
+        evade1.push_back(s2);
+
+		for(int i=0; i<strlen(ref1); i++){
+            s3 += ref1[i] ;
+        }
+        refhood.push_back(s3);
+	}
+	fclose(fptr);
+	//done storing data of Refund file.
+
+
+	//for marital likelihood.
+	vector<string>marry;
+	vector<string>evade2;
+	vector<string>maritalhood;
+
+	if ((fptr = fopen("maritalhood.txt", "r")) == NULL) {
+        printf("Error! opening file");
+        exit(1);
+    }
+
+	char m1[100], e2[100], mar[100];
+
+	while(fscanf(fptr, "%s %s %s", m1, e2, mar)!=EOF){
+		string s1="";
+		string s2="";
+		string s3="";
+
+		for(int i=0; i<strlen(m1); i++){
+            s1 += m1[i] ;
+        }
+        marry.push_back(s1);
+
+		for(int i=0; i<strlen(e2); i++){
+            s2 += e2[i] ;
+        }
+        evade2.push_back(s2);
+
+		for(int i=0; i<strlen(mar); i++){
+            s3 += mar[i] ;
+        }
+        maritalhood.push_back(s3);
+	}
+	fclose(fptr);
+	//done storing data of marital file.
+
+
+
+	//for tax likelihood.
+	vector<string>tax;
+	vector<string>evade3;
+	vector<string>taxhood;
+
+	if ((fptr = fopen("taxhood.txt", "r")) == NULL) {
+        printf("Error! opening file");
+        exit(1);
+    }
+
+	char t[100], e3[100], taxx[100];
+
+	while(fscanf(fptr, "%s %s %s", t, e3, taxx)!=EOF){
+		string s1="";
+		string s2="";
+		string s3="";
+
+		for(int i=0; i<strlen(t); i++){
+            s1 += t[i] ;
+        }
+        tax.push_back(s1);
+
+		for(int i=0; i<strlen(e3); i++){
+            s2 += e3[i] ;
+        }
+        evade3.push_back(s2);
+
+		for(int i=0; i<strlen(taxx); i++){
+            s3 += taxx[i] ;
+        }
+        taxhood.push_back(s3);
+	}   //done storing data of tax file.
+	fclose(fptr);
+
+
+    string P_R_Y, P_R_N, P_M_Y, P_M_N, P_T_Y, P_T_N;
+    double pry, prn, pmy, pmn, pty, ptn;
+
+    for(int i=0;i<refund.size();i++){
+        for(int j=0;j<refund1.size();j++){
+            if(refund[i]==refund1[j]){
+                if(evade1[j]=="yes"){
+                    P_R_Y = refhood[j];
+                    pry = std::stod(P_R_Y);
+                }
+                else{
+                    P_R_N = refhood[j];
+                    prn = std::stod(P_R_N);
+                }
+            }
+        }
+        break;
+    }
+    cout<<P_R_Y<<"  "<<P_R_N<<"\n";
+
+    for(int i=0;i<marital.size();i++){
+        for(int j=0;j<marry.size();j++){
+            if(marital[i]==marry[j]){
+                if(evade2[j]=="yes"){
+                    P_M_Y = maritalhood[j];
+                    pmy = std::stod(P_M_Y);
+                }
+                else{
+                    P_M_N = maritalhood[j];
+                    pmn = std::stod(P_M_N);
+                }
+            }
+        }
+        break;
+    }
+    cout<<P_M_Y<<"  "<<P_M_N<<"\n";
+
+    for(int i=0;i<income.size();i++){
+        for(int j=0;j<tax.size();j++){
+            if(income[i]==tax[j]){
+                if(evade3[j]=="yes"){
+                    P_T_Y = taxhood[j];
+                    pty = std::stod(P_T_Y);
+                }
+                else{
+                    P_T_N = taxhood[j];
+                    ptn = std::stod(P_T_N);
+                }
+            }
+        }
+        break;
+    }
+    cout<<P_T_Y<<" "<<P_T_N<<"\n\n";
+
+    double yes = (pry*pmy*pty)*1.00;
+    double no =  (prn*pmn*ptn)*1.00;
+
+    if(yes>no)
+        cout<<"'YES' Class"<<"\n";
+    else
+        cout<<"'NO' Class"<<"\n";
+
+
+
+	return 0;
+}

From 6ba6acf7bca2725bd703499b9c47ba43d12a7ee5 Mon Sep 17 00:00:00 2001
From: farhan <farhanasfar21@gmail.com>
Date: Sun, 22 Jan 2023 23:46:24 +0600
Subject: [PATCH 3/3] added a text file to explain the problem

---
 algorithms/artificial-intelligence/Naive Bayesian/codeGuide.txt | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 create mode 100644 algorithms/artificial-intelligence/Naive Bayesian/codeGuide.txt

diff --git a/algorithms/artificial-intelligence/Naive Bayesian/codeGuide.txt b/algorithms/artificial-intelligence/Naive Bayesian/codeGuide.txt
new file mode 100644
index 00000000..e69de29b