hacktoberfest2k20 · prkhrv · Oct 6, 2020
diff --git a/3sum.cpp → Algebra-and-Numerical-Methods/cpp/3sum.cpp b/3sum.cpp → Algebra-and-Numerical-Methods/cpp/3sum.cpp
diff --git a/...umerical-Methods/IntegerFactorizeAlgo.cpp → ...ical-Methods/cpp/IntegerFactorizeAlgo.cpp b/...umerical-Methods/IntegerFactorizeAlgo.cpp → ...ical-Methods/cpp/IntegerFactorizeAlgo.cpp
diff --git a/...Numerical-Methods/SieveOfEratosthenes.cpp → ...rical-Methods/cpp/SieveOfEratosthenes.cpp b/...Numerical-Methods/SieveOfEratosthenes.cpp → ...rical-Methods/cpp/SieveOfEratosthenes.cpp
diff --git a/logarithmic_power.cpp → ...merical-Methods/cpp/logarithmic_power.cpp b/logarithmic_power.cpp → ...merical-Methods/cpp/logarithmic_power.cpp
diff --git a/Fractional_Knapsack.cpp → Algorithms/cpp/Fractional_Knapsack.cpp b/Fractional_Knapsack.cpp → Algorithms/cpp/Fractional_Knapsack.cpp
diff --git a/Lees_algo.cpp → Algorithms/cpp/Lees_algo.cpp b/Lees_algo.cpp → Algorithms/cpp/Lees_algo.cpp
@@ -33,7 +33,7 @@ bool isValid(int mat[][N], bool visited[][N], int row, int col)
 void BFS(int mat[][N], int i, int j, int x, int y)// BFS algorithm
 {
 
-	bool visited[M][N]
+	bool visited[M][N];
 	memset(visited, false, sizeof visited);
 	queue<Node> q;
 

diff --git a/Data-Structures/Hashing.c → Data-Structures/c/Hashing.c b/Data-Structures/Hashing.c → Data-Structures/c/Hashing.c
diff --git a/Data-Structures/BalancedBrackets.cpp → Data-Structures/cpp/BalancedBrackets.cpp b/Data-Structures/BalancedBrackets.cpp → Data-Structures/cpp/BalancedBrackets.cpp
diff --git a/Data-Structures/SquareRootDecompostion.cpp → ...Structures/cpp/SquareRootDecompostion.cpp b/Data-Structures/SquareRootDecompostion.cpp → ...Structures/cpp/SquareRootDecompostion.cpp
diff --git a/Dynamic-Programming/KadanesAlgo.cpp → Dynamic-Programming/cpp/KadanesAlgo.cpp b/Dynamic-Programming/KadanesAlgo.cpp → Dynamic-Programming/cpp/KadanesAlgo.cpp
diff --git a/Graphs/DFS.cpp → Graphs/cpp/DFS.cpp b/Graphs/DFS.cpp → Graphs/cpp/DFS.cpp
diff --git a/Graphs/HeightOfBinaryTree.cpp → Graphs/cpp/HeightOfBinaryTree.cpp b/Graphs/HeightOfBinaryTree.cpp → Graphs/cpp/HeightOfBinaryTree.cpp
diff --git a/linear_search.c → Searching/c/linear_search.c b/linear_search.c → Searching/c/linear_search.c
diff --git a/Searching/BinarySearchIterative.cpp → Searching/cpp/BinarySearchIterative.cpp b/Searching/BinarySearchIterative.cpp → Searching/cpp/BinarySearchIterative.cpp
diff --git a/Searching/BinarySearchRecursion.cpp → Searching/cpp/BinarySearchRecursion.cpp b/Searching/BinarySearchRecursion.cpp → Searching/cpp/BinarySearchRecursion.cpp
diff --git a/Searching/LinearSearch.cpp → Searching/cpp/LinearSearch.cpp b/Searching/LinearSearch.cpp → Searching/cpp/LinearSearch.cpp
diff --git a/breadth_first_search.cpp → Searching/cpp/breadth_first_search.cpp b/breadth_first_search.cpp → Searching/cpp/breadth_first_search.cpp
diff --git a/Searching/python/linear_search.py b/Searching/python/linear_search.py
@@ -0,0 +1,15 @@
+def linear_search(arr, key):
+    found = False
+    for i in range(0,len(arr)):
+        if arr[i] == key:
+            print("Element Found at position {}".format(i+1))
+            found = True
+    if found == False:
+        print("Element NOT Found")
+
+
+# Driver Code
+
+arr = [2,4,5,6,7,2]
+linear_search(arr,2)
+linear_search(arr,10)
diff --git a/Sorting/BubbleSort.cpp → Sorting/cpp/BubbleSort.cpp b/Sorting/BubbleSort.cpp → Sorting/cpp/BubbleSort.cpp
diff --git a/Sorting/MergeSort.cpp → Sorting/cpp/MergeSort.cpp b/Sorting/MergeSort.cpp → Sorting/cpp/MergeSort.cpp
diff --git a/Sorting/QuickSort.cpp → Sorting/cpp/QuickSort.cpp b/Sorting/QuickSort.cpp → Sorting/cpp/QuickSort.cpp
diff --git a/Selection_Sort.cpp → Sorting/cpp/Selection_Sort.cpp b/Selection_Sort.cpp → Sorting/cpp/Selection_Sort.cpp
diff --git a/bucket_sort.cpp → Sorting/cpp/bucket_sort.cpp b/bucket_sort.cpp → Sorting/cpp/bucket_sort.cpp