solved issue

Author: ajay-dhangar

docs/dsa/algorithms/patternsearchalgorithm.md

@@ -4,7 +4,7 @@ title: Pattern Searching Algorithm in Data Structures and Algorithms
 sidebar_label: Pattern Searching Algorithm
 sidebar_position: 7
 description: "The Pattern Searching Algorithm is a powerful tool used to find occurrences of a pattern within a larger text or string."
-tags:[dsa,data-algorithms , pattern-searching]
+tags: [dsa,data-algorithms , pattern-searching]
 ---
 
 
@@ -64,4 +64,4 @@ Once the algorithm has finished iterating through the entire text, it returns th
 
 The Naive Pattern Searching Algorithm is relatively simple to implement and understand, making it a good starting point for pattern searching tasks. However, it has a time complexity of O((n-m+1)*m), where n is the length of the text and m is the length of the pattern. This means that the algorithm's performance can degrade for large texts or patterns.
 
-There are more advanced pattern searching algorithms, such as the Knuth-Morris-Pratt (KMP) algorithm and the Boyer-Moore algorithm, which offer better time complexity and improved performance in certain scenarios. However, the Naive Pattern Searching Algorithm serves as a foundation for understanding pattern searching concepts and can be a useful starting point for simple cases.
+There are more advanced pattern searching algorithms, such as the Knuth-Morris-Pratt (KMP) algorithm and the Boyer-Moore algorithm, which offer better time complexity and improved performance in certain scenarios. However, the Naive Pattern Searching Algorithm serves as a foundation for understanding pattern searching concepts and can be a useful starting point for simple cases.