diff --git a/Conversions/OctalToHexadecimal.java b/Conversions/OctalToHexadecimal.java
index 4035ada70..589fefbb5 100644
--- a/Conversions/OctalToHexadecimal.java
+++ b/Conversions/OctalToHexadecimal.java
@@ -51,10 +51,10 @@ public class OctalToHexadecimal {
     // Take octal number as input from user in a string
     String oct = input.next();
 
-    // Pass the octal number to function and get converted deciaml form
+    // Pass the octal number to function and get converted decimal form
     int decimal = octToDec(oct);
 
-    // Pass the decimla number to function and get converted Hex form of the number
+    // Pass the decimal number to function and get converted Hex form of the number
     String hex = decimalToHex(decimal);
     System.out.println("The Hexadecimal equivalant is: " + hex);
     input.close();
diff --git a/DynamicProgramming/RegexMatching.java b/DynamicProgramming/RegexMatching.java
index 2b89b5c60..724e53886 100644
--- a/DynamicProgramming/RegexMatching.java
+++ b/DynamicProgramming/RegexMatching.java
@@ -9,7 +9,7 @@ package DynamicProgramming;
  **/
 
 /**
- * For calculation Time and Space Complexity. Let N be length of src and M be length of pat
+ * For calculation of Time and Space Complexity. Let N be length of src and M be length of pat
  **/
 
 public class RegexMatching {
@@ -168,4 +168,4 @@ public class RegexMatching {
 
 }
 // Memoization vs Tabulation : https://www.geeksforgeeks.org/tabulation-vs-memoization/
-// Question Link : https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1
\ No newline at end of file
+// Question Link : https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1
diff --git a/Sorts/BitonicSort.java b/Sorts/BitonicSort.java
index 4888cc070..e75ef118a 100644
--- a/Sorts/BitonicSort.java
+++ b/Sorts/BitonicSort.java
@@ -44,7 +44,7 @@ public class BitonicSort {
       // sort in descending order since dir here is 0
       bitonicSort(a, low + k, k, 0);
 
-      // Will merge wole sequence in ascending order
+      // Will merge whole sequence in ascending order
       // since dir=1.
       bitonicMerge(a, low, cnt, dir);
     }
diff --git a/Sorts/PancakeSort.java b/Sorts/PancakeSort.java
index f679b3722..89ad495eb 100644
--- a/Sorts/PancakeSort.java
+++ b/Sorts/PancakeSort.java
@@ -3,7 +3,7 @@ package Sorts;
 import static Sorts.SortUtils.*;
 
 /**
- * Implementation of gnome sort
+ * Implementation of pancake sort
  *
  * @author Podshivalov Nikita (https://github.com/nikitap492)
  * @since 2018-04-10