From 96e5629616a91142b3643ce0046642f49686c355 Mon Sep 17 00:00:00 2001
From: Rehan Guha <rehanguha29@gmail.com>
Date: Wed, 1 Jul 2020 01:39:35 +0530
Subject: [PATCH] Added Python, Structured Repo

---
 .gitignore                                 |   2 +
 GridSearching.cpp => C++/GridSearching.cpp |   2 +-
 LinearSearch.cpp => C++/LinearSearch.cpp   |   0
 a.out => C++/a.out                         | Bin
 Python/GridSearching.py                    |  78 ++++++++++++
 q.cpp                                      | 135 ---------------------
 6 files changed, 81 insertions(+), 136 deletions(-)
 create mode 100644 .gitignore
 rename GridSearching.cpp => C++/GridSearching.cpp (96%)
 rename LinearSearch.cpp => C++/LinearSearch.cpp (100%)
 rename a.out => C++/a.out (100%)
 create mode 100644 Python/GridSearching.py
 delete mode 100755 q.cpp

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..fd5d2ec
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,2 @@
+.vscode
+gridsearching_dev
\ No newline at end of file
diff --git a/GridSearching.cpp b/C++/GridSearching.cpp
similarity index 96%
rename from GridSearching.cpp
rename to C++/GridSearching.cpp
index ad520d5..2b0385c 100755
--- a/GridSearching.cpp
+++ b/C++/GridSearching.cpp
@@ -114,7 +114,7 @@ int grid_search(int arr[MAX][MAX],int NUM,int n=MAX)
 
 int main()
 {
-    int arr[MAX][MAX]={{1,2,3,4},{5,6,7,8},{9,10,11,12},{13,14,15,16}};
+    int arr[MAX][MAX]={{71,2,3,84},{5,66,7,8},{9,180,11,182},{413,3414,515,126}};
     int num;
     cout<<"Enter no.:";
     cin>>num;
diff --git a/LinearSearch.cpp b/C++/LinearSearch.cpp
similarity index 100%
rename from LinearSearch.cpp
rename to C++/LinearSearch.cpp
diff --git a/a.out b/C++/a.out
similarity index 100%
rename from a.out
rename to C++/a.out
diff --git a/Python/GridSearching.py b/Python/GridSearching.py
new file mode 100644
index 0000000..97cafc3
--- /dev/null
+++ b/Python/GridSearching.py
@@ -0,0 +1,78 @@
+def _range(n):
+    t = 0
+    if n % 3 == 1:
+        t = ((n+2)/3)
+    elif n%3 == 2:
+        t = ((n+1)/3)
+    else:
+        t=((n)/3)
+    return t*t 
+
+def check(A, i, j, NUM, dim):
+    if ((i>=0 and i<dim) and (j>=0 and j<dim) and A[i][j]==NUM):
+        return 1
+    return 0
+
+
+def GridSearch(A, NUM, dim):
+    flag = False
+    f_i = f_j = None
+    t = int(_range(dim))
+    for i in range(1, t+1, 3):
+        for j in range(1, t+1, 3):
+            if check(A, i-1, j-1, NUM, dim):
+                flag = True
+                f_i = i-1
+                f_j = j-1
+                break
+            if check(A, i-1, j, NUM, dim):
+                flag = True
+                f_i = i-1
+                f_j = j
+                break
+            if check(A, i, j-1, NUM, dim):
+                flag = True
+                f_i = i
+                f_j = j-1
+                break
+            if check(A, i-1, j+1, NUM, dim):
+                flag = True
+                f_i = i-1
+                f_j = j+1
+                break
+            if check(A, i, j, NUM, dim):
+                flag = True
+                f_i = i
+                f_j = j
+                break
+            if check(A, i, j+1, NUM, dim):
+                flag = True
+                f_i = i
+                f_j = j+1
+                break
+            if check(A, i+1, j, NUM, dim):
+                flag = True
+                f_i = i+1
+                f_j = j
+                break
+            if check(A, i+1, j+1, NUM, dim):
+                flag = True
+                f_i = i+1
+                f_j = j+1
+                break
+        if flag:
+            break
+
+    return flag, f_i, f_j
+
+if __name__ == "__main__":
+    A = [[12,2,31,44],[5,36,7,82],[9,310,121,132],[313,145,515,616]]
+
+    SearchNumber = 515
+    
+    found, i, j = GridSearch(A,SearchNumber, len(A))
+
+    if found:
+        print(i,",",j)
+    else:
+        print("Not Found")
\ No newline at end of file
diff --git a/q.cpp b/q.cpp
deleted file mode 100755
index 51e58da..0000000
--- a/q.cpp
+++ /dev/null
@@ -1,135 +0,0 @@
-#include<iostream>
-
-using namespace std;
-
-#define MAX 200
-
-int f_i,f_j;
-
-
-int check(int arr[MAX][MAX],int i,int j,int num,int n=MAX)
-{
-	if(((i>=0) && (i<n))&&((j>=0) && (j<n)) && arr[i][j]==num)
-	{
-		return 1;
-	}
-	return 0;
-}
-
-int range(int n)
-{
-    int t;
-    if(n%3==1)
-    {
-        t=((n+2)/3);
-    }
-    else if(n%3==2)
-    {
-        t=((n+1)/3);
-    }
-    else
-        t=((n)/3);
-    return t*t;
-}
-int grid_search(int arr[MAX][MAX],int NUM,int n=MAX)
-{
-    int flag=0;
-    int t=range(n);
-    //cout<<t;
-    for(int i=1;i<=t;i=i+3)
-    {
-        for(int j=1;j<=t;j=j+3)
-        {
-        	//cout<<"\n"<<i<<"-"<<j;
-            if(check(arr,i-1,j-1,NUM))
-            {
-                flag=1;
-                f_i=i-1;
-                f_j=j-1;
-                return 1;
-            }
-            if(check(arr,i-1,j,NUM))
-            {
-                flag=1;
-                f_i=i-1;
-                f_j=j;
-                return 1;
-            }
-            if(check(arr,i,j-1,NUM))
-            {
-                flag=1;
-                f_i=i;
-                f_j=j-1;
-                return 1;
-            }
-            if(check(arr,i-1,j+1,NUM))
-            {
-                flag=1;
-                f_i=i-1;
-                f_j=j+1;
-                return 1;
-            }
-            if(check(arr,i,j,NUM))
-            {
-                flag=1;
-                f_i=i;
-                f_j=j;
-                return 1;
-            }
-            if(check(arr,i,j+1,NUM))
-            {
-                flag=1;
-                f_i=i;
-                f_j=j+1;
-                return 1;
-            }
-            if(check(arr,i+1,j-1,NUM))
-            {
-                flag=1;
-                f_i=i+1;
-                f_j=j-1;
-                return 1;
-            }
-            if(check(arr,i+1,j,NUM))
-            {
-                flag=1;
-                f_i=i+1;
-                f_j=j;
-                return 1;
-            }
-            if(check(arr,i+1,j+1,NUM))
-            {
-                flag=1;
-                f_i=i+1;
-                f_j=j+1;
-                return 1;
-            }
-        }
-    }
-    if(flag == 0)
-    {
-        return 0;
-    }
-}
-
-int main()
-{
-    int k=0;
-    int arr[MAX][MAX];
-    //int arr[MAX][MAX]={{1,2,3,4},{5,6,7,8},{9,10,11,12},{13,14,15,16}};
-    for(int i=0;i<MAX;i++)
-        for(int j=0;j<MAX;j++)
-            arr[i][j]= ++k;
-    int num;
-    cout<<"Enter no.:";
-    cin>>num;
-    cout<<"\nResult:\n";
-    if(grid_search(arr,num))
-    {
-    	
-       cout<<"\n"<<f_i<<"\t"<<f_j;
-    }
-    else
-        cout<<"\nNOT FOUND";
-    return 0;    
-}