Fix typos (TheAlgorithms#2457)

Manan-Rathi · web-flow · commit 374938c3f89b · 2021-10-04T20:31:06.000+03:00
diff --git a/Conversions/OctalToHexadecimal.java b/Conversions/OctalToHexadecimal.java
@@ -51,10 +51,10 @@ public static void main(String args[]) {
     // 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
@@ -9,7 +9,7 @@
  **/
 
 /**
- * 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 static void main(String[] args) {
 
 }
 // Memoization vs Tabulation : https://www.geeksforgeeks.org/tabulation-vs-memoization/
-// Question Link : https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1
+// Question Link : https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1
diff --git a/Sorts/BitonicSort.java b/Sorts/BitonicSort.java
@@ -44,7 +44,7 @@ void bitonicSort(int a[], int low, int cnt, int dir) {
       // 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
@@ -3,7 +3,7 @@
 import static Sorts.SortUtils.*;
 
 /**
- * Implementation of gnome sort
+ * Implementation of pancake sort
  *
  * @author Podshivalov Nikita (https://github.com/nikitap492)
  * @since 2018-04-10

Original file line number	Diff line number	Diff line change
`@@ -44,7 +44,7 @@ void bitonicSort(int a[], int low, int cnt, int dir) {`
`44`	`44`	`// sort in descending order since dir here is 0`
`45`	`45`	`bitonicSort(a, low + k, k, 0);`
`46`	`46`
`47`		`- // Will merge wole sequence in ascending order`
	`47`	`+ // Will merge whole sequence in ascending order`
`48`	`48`	`// since dir=1.`
`49`	`49`	`bitonicMerge(a, low, cnt, dir);`
`50`	`50`	`}`
Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@`
`3`	`3`	`import static Sorts.SortUtils.*;`
`4`	`4`
`5`	`5`	`/**`
`6`		`- * Implementation of gnome sort`
	`6`	`+ * Implementation of pancake sort`
`7`	`7`	`*`
`8`	`8`	`* @author Podshivalov Nikita (https://github.com/nikitap492)`
`9`	`9`	`* @since 2018-04-10`