diff --git a/README.md b/README.md
index 8dbe820..9f5ef6d 100644
--- a/README.md
+++ b/README.md
@@ -40,7 +40,7 @@ will be adding must go in the proper folder.
 - Kruskal’s Minimum Spanning Tree Algorithm
 - Huffman Coding
 - Prim’s Minimum Spanning Tree Algorithm
-- Dijkstra’s Shortest Path Algorithm
+- Dijkstra’s Shortest ah Algorithm
 - Job Sequencing Problem
 - K Centers Problem
 
@@ -53,12 +53,12 @@ will be adding must go in the proper folder.
 
 ### String Algorithms (Carries 2 points)
 
-- Naive Pattern Searching
+- Naive atern Searching
 - KMP Algorithm
 - Rabin-Karp Algorithm
 - Boyer Moore Algorithm – Bad Character Heuristic
 - Anagram Substring Search
-- Aho-Corasick Algorithm for Pattern Searching
+- Aho-Corasick Algorithm for atern Searching
 - Longest Even Length Substring such that Sum of First and Second Half is same
 
 ### Dynamic Programming and Backtracking (Carries 3 points)
@@ -78,7 +78,7 @@ will be adding must go in the proper folder.
 
 ### Graph Algorithms (Carries 3 points)
 
-- Longest Path in a Directed Acyclic Graph
+- Longest ah in a Directed Acyclic Graph
 - Topological Sorting
 - Snake and Ladder Problem
 - Biconnected Components
diff --git a/c++/naive_pattern_searching.cpp b/c++/naive_pattern_searching.cpp
index 8ab6582..cf8e1fc 100644
--- a/c++/naive_pattern_searching.cpp
+++ b/c++/naive_pattern_searching.cpp
@@ -13,11 +13,11 @@ int main()
 	vector <int> index;
 	cout<<"Enter the string here : ";
 	getline(cin,s);
-	cout<<"Enter the pattern you want to search here : ";
+	cout<<"Enter the atern you want to search here : ";
 	getline(cin,search_s);
 	search_stringSearch(search_s, s);
 	index=search_stringSearch(search_s, s);
-	cout << "The entered pattern occurs in the entered string at:   "<<endl;
+	cout << "The entered atern occurs in the entered string at:   "<<endl;
 	for(int i=0;i<index.size();i++)
 	cout<<index[i]<<" ";
 	return 0;
diff --git a/python/naive_pattern_search.py b/python/naive_pattern_search.py
new file mode 100644
index 0000000..aa081e9
--- /dev/null
+++ b/python/naive_pattern_search.py
@@ -0,0 +1,20 @@
+def search(a, b):
+    m = len(a)
+    n = len(b)
+ 
+
+    for i in range(n - m + 1):
+        j = 0
+         
+        while(j < m):
+            if (b[i + j] != a[j]):
+                break
+            j += 1
+ 
+        if (j == m):
+            print("pattern found at index ", i)
+ 
+
+b = input("Enter Text: ")
+a = input("Enter pattern to search: ")
+search(a, b)
\ No newline at end of file