Merge branch 'master' into GoldbachBranch1

Author: BILLSARAN

spotbugs-exclude.xml

@@ -114,9 +114,6 @@
     <Match>
         <Bug pattern="BL_BURYING_LOGIC" />
     </Match>
-    <Match>
-        <Bug pattern="PCOA_PARTIALLY_CONSTRUCTED_OBJECT_ACCESS" />
-    </Match>
     <Match>
         <Bug pattern="UTWR_USE_TRY_WITH_RESOURCES" />
     </Match>

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

@@ -10,6 +10,7 @@
  * An Armstrong number is often called a Narcissistic number.
  *
  * @author satyabarghav
+ * @modifier rahul katteda - (13/01/2025) - [updated the logic for getting total number of digits]
  */
 public class Armstrong {
 
@@ -20,14 +21,16 @@ public class Armstrong {
      * @return {@code true} if the given number is an Armstrong number, {@code false} otherwise
      */
     public boolean isArmstrong(int number) {
+        if (number < 0) {
+            return false; // Negative numbers cannot be Armstrong numbers
+        }
         long sum = 0;
-        String temp = Integer.toString(number); // Convert the given number to a string
-        int power = temp.length(); // Extract the length of the number (number of digits)
+        int totalDigits = (int) Math.log10(number) + 1; // get the length of the number (number of digits)
         long originalNumber = number;
 
         while (originalNumber > 0) {
             long digit = originalNumber % 10;
-            sum += (long) Math.pow(digit, power); // The digit raised to the power of the number of digits and added to the sum.
+            sum += (long) Math.pow(digit, totalDigits); // The digit raised to the power of total number of digits and added to the sum.
             originalNumber /= 10;
         }
 

src/main/java/com/thealgorithms/scheduling/SJFScheduling.java

@@ -14,6 +14,18 @@ public class SJFScheduling {
     protected ArrayList<ProcessDetails> processes;
     protected ArrayList<String> schedule;
 
+    private static void sortProcessesByArrivalTime(List<ProcessDetails> processes) {
+        for (int i = 0; i < processes.size(); i++) {
+            for (int j = i + 1; j < processes.size() - 1; j++) {
+                if (processes.get(j).getArrivalTime() > processes.get(j + 1).getArrivalTime()) {
+                    final var temp = processes.get(j);
+                    processes.set(j, processes.get(j + 1));
+                    processes.set(j + 1, temp);
+                }
+            }
+        }
+    }
+
     /**
      * a simple constructor
      * @param processes a list of processes the user wants to schedule
@@ -22,22 +34,10 @@ public class SJFScheduling {
     SJFScheduling(final ArrayList<ProcessDetails> processes) {
         this.processes = processes;
         schedule = new ArrayList<>();
-        sortByArrivalTime();
+        sortProcessesByArrivalTime(this.processes);
     }
     protected void sortByArrivalTime() {
-        int size = processes.size();
-        int i;
-        int j;
-        ProcessDetails temp;
-        for (i = 0; i < size; i++) {
-            for (j = i + 1; j < size - 1; j++) {
-                if (processes.get(j).getArrivalTime() > processes.get(j + 1).getArrivalTime()) {
-                    temp = processes.get(j);
-                    processes.set(j, processes.get(j + 1));
-                    processes.set(j + 1, temp);
-                }
-            }
-        }
+        sortProcessesByArrivalTime(processes);
     }
 
     /**