Merge branch 'master' into src/main/java/com/thealgorithms/datastructures/queues/PriorityQueues.java

Author: alxkm

src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java

@@ -182,7 +182,7 @@ public double closestPair(final Location[] a, final int indexNum) {
 
         double minLeftArea; // Minimum length of left array
         double minRightArea; // Minimum length of right array
-        double minValue; // Minimum lengt
+        double minValue; // Minimum length
 
         minLeftArea = closestPair(leftArray, divideX); // recursive closestPair
         minRightArea = closestPair(rightArray, indexNum - divideX);

src/main/java/com/thealgorithms/divideandconquer/SkylineAlgorithm.java

@@ -161,7 +161,7 @@ public int getY() {
          * function dominates the argument point.
          *
          * @param p1 the point that is compared
-         * @return true if the point wich calls the function dominates p1 false
+         * @return true if the point which calls the function dominates p1 false
          * otherwise.
          */
         public boolean dominates(Point p1) {

src/main/java/com/thealgorithms/maths/BinomialCoefficient.java

@@ -1,8 +1,8 @@
 package com.thealgorithms.maths;
 
 /*
- * Java program for Binomial Cofficients
- * Binomial Cofficients: A binomial cofficient C(n,k) gives number ways
+ * Java program for Binomial Coefficients
+ * Binomial Coefficients: A binomial coefficient C(n,k) gives number ways
  * in which k objects can be chosen from n objects.
  * Wikipedia: https://en.wikipedia.org/wiki/Binomial_coefficient
  *

src/main/java/com/thealgorithms/maths/SieveOfAtkin.java

@@ -14,7 +14,7 @@
 public final class SieveOfAtkin {
 
     private SieveOfAtkin() {
-        // Utlity class; prevent instantiation
+        // Utility class; prevent instantiation
     }
 
     /**

src/main/java/com/thealgorithms/matrix/RotateMatrixBy90Degrees.java

@@ -40,7 +40,7 @@ static void printMatrix(int[][] arr) {
 }
 
 /**
- * Class containing the algo to roate matrix by 90 degree
+ * Class containing the algo to rotate matrix by 90 degree
  */
 final class Rotate {
     private Rotate() {

src/main/java/com/thealgorithms/others/BankersAlgorithm.java

@@ -3,7 +3,7 @@
 import java.util.Scanner;
 
 /**
- * This file contains an implementation of BANKER'S ALGORITM Wikipedia:
+ * This file contains an implementation of BANKER'S ALGORITHM Wikipedia:
  * https://en.wikipedia.org/wiki/Banker%27s_algorithm
  *
  * The algorithm for finding out whether or not a system is in a safe state can

src/main/java/com/thealgorithms/others/GaussLegendre.java

@@ -1,7 +1,7 @@
 package com.thealgorithms.others;
 
 /**
- * Guass Legendre Algorithm ref
+ * Gauss Legendre Algorithm ref
  * https://en.wikipedia.org/wiki/Gauss–Legendre_algorithm
  *
  * @author AKS1996

src/main/java/com/thealgorithms/others/Implementing_auto_completing_features_using_trie.java

@@ -97,7 +97,7 @@ static void suggestionsRec(TrieNode root, String currPrefix) {
         }
     }
 
-    // Fucntion  to print suggestions for
+    // Function  to print suggestions for
     // given query prefix.
     static int printAutoSuggestions(TrieNode root, final String query) {
         TrieNode pCrawl = root;

src/main/java/com/thealgorithms/others/IterativeFloodFill.java

@@ -32,8 +32,8 @@ private IterativeFloodFill() {
      * Iteratively fill the 2D image with new color
      *
      * @param image    The image to be filled
-     * @param x        The x co-ordinate at which color is to be filled
-     * @param y        The y co-ordinate at which color is to be filled
+     * @param x        The x coordinate at which color is to be filled
+     * @param y        The y coordinate at which color is to be filled
      * @param newColor The new color which to be filled in the image
      * @param oldColor The old color which is to be replaced in the image
      * @see <a href=https://www.geeksforgeeks.org/dsa/flood-fill-algorithm>FloodFill BFS<a/>
@@ -86,8 +86,8 @@ private static class Point {
      * Checks if a pixel should be skipped during flood fill operation.
      *
      * @param image    The image to get boundaries
-     * @param x        The x co-ordinate of pixel to check
-     * @param y        The y co-ordinate of pixel to check
+     * @param x        The x coordinate of pixel to check
+     * @param y        The y coordinate of pixel to check
      * @param oldColor The old color which is to be replaced in the image
      * @return {@code true} if pixel should be skipped, else {@code false}
      */

src/main/java/com/thealgorithms/others/MemoryManagementAlgorithms.java

@@ -16,7 +16,7 @@ public abstract class MemoryManagementAlgorithms {
      * blocks available.
      * @param sizeOfProcesses: an int array that contains the sizes of the
      * processes we need memory blocks for.
-     * @return the ArrayList filled with Integers repressenting the memory
+     * @return the ArrayList filled with Integers representing the memory
      * allocation that took place.
      */
     public abstract ArrayList<Integer> fitProcess(int[] sizeOfBlocks, int[] sizeOfProcesses);
@@ -91,7 +91,7 @@ private static int findBestFit(int[] blockSizes, int processSize) {
      * blocks available.
      * @param sizeOfProcesses: an int array that contains the sizes of the
      * processes we need memory blocks for.
-     * @return the ArrayList filled with Integers repressenting the memory
+     * @return the ArrayList filled with Integers representing the memory
      * allocation that took place.
      */
     public ArrayList<Integer> fitProcess(int[] sizeOfBlocks, int[] sizeOfProcesses) {
@@ -149,7 +149,7 @@ private static int findWorstFit(int[] blockSizes, int processSize) {
      * blocks available.
      * @param sizeOfProcesses: an int array that contains the sizes of the
      * processes we need memory blocks for.
-     * @return the ArrayList filled with Integers repressenting the memory
+     * @return the ArrayList filled with Integers representing the memory
      * allocation that took place.
      */
     public ArrayList<Integer> fitProcess(int[] sizeOfBlocks, int[] sizeOfProcesses) {
@@ -201,7 +201,7 @@ private static int findFirstFit(int[] blockSizes, int processSize) {
      * blocks available.
      * @param sizeOfProcesses: an int array that contains the sizes of the
      * processes we need memory blocks for.
-     * @return the ArrayList filled with Integers repressenting the memory
+     * @return the ArrayList filled with Integers representing the memory
      * allocation that took place.
      */
     public ArrayList<Integer> fitProcess(int[] sizeOfBlocks, int[] sizeOfProcesses) {
@@ -262,7 +262,7 @@ private int findNextFit(int[] blockSizes, int processSize) {
      * blocks available.
      * @param sizeOfProcesses: an int array that contains the sizes of the
      * processes we need memory blocks for.
-     * @return the ArrayList filled with Integers repressenting the memory
+     * @return the ArrayList filled with Integers representing the memory
      * allocation that took place.
      */
     public ArrayList<Integer> fitProcess(int[] sizeOfBlocks, int[] sizeOfProcesses) {