add change

Author: avabarzegar

src/main/java/com/thealgorithms/bitmanipulation/SingleBitOperations.java

@@ -1,34 +1,34 @@
-package com.thealgorithms.bitmanipulation;
-
-/*
- * Author: lukasb1b (https://github.com/lukasb1b)
- */
-
-public final class SingleBitOperations {
-    private SingleBitOperations() {
-    }
-    /**
-     * Flip the bit at position 'bit' in 'num'
-     */
-    public static int flipBit(final int num, final int bit) {
-        return num ^ (1 << bit);
-    }
-    /**
-     * Set the bit at position 'bit' to 1 in the 'num' variable
-     */
-    public static int setBit(final int num, final int bit) {
-        return num | (1 << bit);
-    }
-    /**
-     * Clears the bit located at 'bit' from 'num'
-     */
-    public static int clearBit(final int num, final int bit) {
-        return num & ~(1 << bit);
-    }
-    /**
-     * Get the bit located at 'bit' from 'num'
-     */
-    public static int getBit(final int num, final int bit) {
-        return ((num >> bit) & 1);
-    }
-}
+package com.thealgorithms.bitmanipulation;
+
+/*
+ * Author: lukasb1b (https://github.com/lukasb1b)
+ */
+
+public final class SingleBitOperations {
+    private SingleBitOperations() {
+    }
+    /**
+     * Flip the bit at position 'bit' in 'num'
+     */
+    public static int flipBit(final int num, final int bit) {
+        return num ^ (1 << bit);
+    }
+    /**
+     * Set the bit at position 'bit' to 1 in the 'num' variable
+     */
+    public static int setBit(final int num, final int bit) {
+        return num | (1 << bit);
+    }
+    /**
+     * Clears the bit located at 'bit' from 'num'
+     */
+    public static int clearBit(final int num, final int bit) {
+        return num & ~(1 << bit);
+    }
+    /**
+     * Get the bit located at 'bit' from 'num'
+     */
+    public static int getBit(final int num, final int bit) {
+        return ((num >> bit) & 1);
+    }
+}

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

@@ -1,62 +1,62 @@
-package com.thealgorithms.others;
-
-import java.util.ArrayList;
-import java.util.List;
-
-public class PrintAMatrixInSpiralOrder {
-    /**
-     * Search a key in row and column wise sorted matrix
-     *
-     * @param matrix matrix to be searched
-     * @param row    number of rows matrix has
-     * @param col    number of columns matrix has
-     * @author Sadiul Hakim : https://github.com/sadiul-hakim
-     */
-
-    public List<Integer> print(int[][] matrix, int row, int col) {
-
-        // r traverses matrix row wise from first
-        int r = 0;
-        // c traverses matrix column wise from first
-        int c = 0;
-        int i;
-
-        List<Integer> result = new ArrayList<>();
-
-        while (r < row && c < col) {
-            // print first row of matrix
-            for (i = c; i < col; i++) {
-                result.add(matrix[r][i]);
-            }
-
-            // increase r by one because first row printed
-            r++;
-
-            // print last column
-            for (i = r; i < row; i++) {
-                result.add(matrix[i][col - 1]);
-            }
-
-            // decrease col by one because last column has been printed
-            col--;
-
-            // print rows from last except printed elements
-            if (r < row) {
-                for (i = col - 1; i >= c; i--) {
-                    result.add(matrix[row - 1][i]);
-                }
-
-                row--;
-            }
-
-            // print columns from first except printed elements
-            if (c < col) {
-                for (i = row - 1; i >= r; i--) {
-                    result.add(matrix[i][c]);
-                }
-                c++;
-            }
-        }
-        return result;
-    }
-}
+package com.thealgorithms.others;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class PrintAMatrixInSpiralOrder {
+    /**
+     * Search a key in row and column wise sorted matrix
+     *
+     * @param matrix matrix to be searched
+     * @param row    number of rows matrix has
+     * @param col    number of columns matrix has
+     * @author Sadiul Hakim : https://github.com/sadiul-hakim
+     */
+
+    public List<Integer> print(int[][] matrix, int row, int col) {
+
+        // r traverses matrix row wise from first
+        int r = 0;
+        // c traverses matrix column wise from first
+        int c = 0;
+        int i;
+
+        List<Integer> result = new ArrayList<>();
+
+        while (r < row && c < col) {
+            // print first row of matrix
+            for (i = c; i < col; i++) {
+                result.add(matrix[r][i]);
+            }
+
+            // increase r by one because first row printed
+            r++;
+
+            // print last column
+            for (i = r; i < row; i++) {
+                result.add(matrix[i][col - 1]);
+            }
+
+            // decrease col by one because last column has been printed
+            col--;
+
+            // print rows from last except printed elements
+            if (r < row) {
+                for (i = col - 1; i >= c; i--) {
+                    result.add(matrix[row - 1][i]);
+                }
+
+                row--;
+            }
+
+            // print columns from first except printed elements
+            if (c < col) {
+                for (i = row - 1; i >= r; i--) {
+                    result.add(matrix[i][c]);
+                }
+                c++;
+            }
+        }
+        return result;
+    }
+}

src/main/java/com/thealgorithms/searches/SearchInARowAndColWiseSortedMatrix.java

@@ -1,34 +1,34 @@
-package com.thealgorithms.searches;
-
-public class SearchInARowAndColWiseSortedMatrix {
-    /**
-     * Search a key in row and column wise sorted matrix
-     *
-     * @param matrix matrix to be searched
-     * @param value  Key being searched for
-     * @author Sadiul Hakim : https://github.com/sadiul-hakim
-     */
-
-    public int[] search(int[][] matrix, int value) {
-        int n = matrix.length;
-        // This variable iterates over rows
-        int i = 0;
-        // This variable iterates over columns
-        int j = n - 1;
-        int[] result = {-1, -1};
-
-        while (i < n && j >= 0) {
-            if (matrix[i][j] == value) {
-                result[0] = i;
-                result[1] = j;
-                return result;
-            }
-            if (value > matrix[i][j]) {
-                i++;
-            } else {
-                j--;
-            }
-        }
-        return result;
-    }
-}
+package com.thealgorithms.searches;
+
+public class SearchInARowAndColWiseSortedMatrix {
+    /**
+     * Search a key in row and column wise sorted matrix
+     *
+     * @param matrix matrix to be searched
+     * @param value  Key being searched for
+     * @author Sadiul Hakim : https://github.com/sadiul-hakim
+     */
+
+    public int[] search(int[][] matrix, int value) {
+        int n = matrix.length;
+        // This variable iterates over rows
+        int i = 0;
+        // This variable iterates over columns
+        int j = n - 1;
+        int[] result = {-1, -1};
+
+        while (i < n && j >= 0) {
+            if (matrix[i][j] == value) {
+                result[0] = i;
+                result[1] = j;
+                return result;
+            }
+            if (value > matrix[i][j]) {
+                i++;
+            } else {
+                j--;
+            }
+        }
+        return result;
+    }
+}