Made some cosmetic changes

Author: master-fury

Pattern Searching/src/Rabin Karp.cpp

@@ -1,6 +1,6 @@
-//#Rapin karp pattern searching algorithm
-//#Best and average time complexity - O(n+m)
-//#Worst case time complexity [O(nm)] when all characters of pattern and text are same
+// Rapin karp pattern searching algorithm
+// Best and average time complexity - O(n+m)
+// Worst case time complexity [O(nm)] when all characters of pattern and text are same
 // as the hash values of all the substrings of txt[] match with hash value of pat[]
 
 #include<bits/stdc++.h>
@@ -72,8 +72,8 @@ int main()
     return 0;
 }
 
-//#Description
-//Rabin karp is one of the efficient algorithm for pattern searching.
-//It uses the concept that calculate the hashvalue for pattern
-//Also calculate for substring of m characters and equate it with that of pattern one
-//If it matches means 1 pattern found
+// Description
+// Rabin karp is one of the efficient algorithm for pattern searching.
+// It uses the concept that calculate the hashvalue for pattern
+// Also calculate for substring of m characters and equate it with that of pattern one
+// If it matches means 1 pattern found