Artemis: Artemis PR

README.md

@@ -5,22 +5,13 @@ This is a sample project for showcasing how optimization can be performed in a J
 
 Build:
 
-```shell
-./gradlew build -x test
-```
 
 Run Main:
 
-```shell
-./gradlew run
-```
 
 Run Unit Tests:
 
-```shell
-./gradlew test
-```
 
 Run Benchmarking:
 
-(will be added later)
+(will be added later)

app/src/main/java/control/Single.java

@@ -1,7 +1,5 @@
 package control;
 
-import java.util.Vector;
-
 public class Single {
   /**
    * This method is used to calculate the sum of the first n natural numbers.
@@ -11,15 +9,8 @@ public class Single {
    * @return The sum of the first n natural numbers.
    */
   public static int sumRange(int n) {
-    int[] arr = new int[n];
-    int sum = 0;
-    for (int i = 0; i < n; i++) {
-      arr[i] = i;
-    }
-    for (int i : arr) {
-      sum += i;
-    }
-    return sum;
+    // Direct calculation using the formula for the sum of the first n natural numbers
+    return (n * (n - 1)) / 2;
   }
 
   /**
@@ -29,10 +20,13 @@ public static int sumRange(int n) {
    * @return The maximum value in the array.
    */
   public static int maxArray(int[] arr) {
-    int max = 0;
-    for (int i : arr) {
-      if (i > max) {
-        max = i;
+    if (arr == null || arr.length == 0) {
+      return 0; // Handle empty or null array
+    }
+    int max = arr[0];
+    for (int i = 1; i < arr.length; i++) {
+      if (arr[i] > max) {
+        max = arr[i];
       }
     }
     return max;
@@ -45,13 +39,7 @@ public static int maxArray(int[] arr) {
    * @param m The modulus.
    */
   public static int sumModulus(int n, int m) {
-    Vector<Integer> multiples = new Vector<Integer>();
-    for (int i = 0; i < n; i++) {
-      if (i % m == 0) {
-        multiples.add(i);
-      }
-    }
-
-    return multiples.stream().mapToInt(Integer::valueOf).sum();
+    int k = (n - 1) / m; // Calculate the number of multiples of m
+    return m * (k * (k + 1)) / 2; // Sum of multiples of m using the formula, more efficient
   }
-}
+}

app/src/main/java/datastructures/DsVector.java

@@ -1,4 +1,6 @@
 package datastructures;
+import java.util.ArrayList;
+import java.util.Collections;
 
 import java.util.Vector;
 
@@ -40,16 +42,10 @@ public static Vector<Integer> searchVector(Vector<Integer> v, int n) {
    */
   public static Vector<Integer> sortVector(Vector<Integer> v) {
     Vector<Integer> ret = new Vector<Integer>(v);
-
-    for (int i = 0; i < ret.size(); i++) {
-      for (int j = 0; j < ret.size() - 1; j++) {
-        if (ret.get(j) > ret.get(j + 1)) {
-          int temp = ret.get(j);
-          ret.set(j, ret.get(j + 1));
-          ret.set(j + 1, temp);
-        }
-      }
-    }
+    ArrayList<Integer> list = new ArrayList<>(ret);
+    Collections.sort(list);
+    ret.clear();
+    ret.addAll(list);
     return ret;
   }
 
@@ -60,11 +56,8 @@ public static Vector<Integer> sortVector(Vector<Integer> v) {
    * @return the reversed vector
    */
   public static Vector<Integer> reverseVector(Vector<Integer> v) {
-    Vector<Integer> ret = new Vector<Integer>();
-
-    for (int i = v.size() - 1; i >= 0; i--) {
-      ret.add(v.get(i));
-    }
+    Vector<Integer> ret = new Vector<Integer>(v);
+    Collections.reverse(ret);
     return ret;
   }
 
@@ -76,14 +69,8 @@ public static Vector<Integer> reverseVector(Vector<Integer> v) {
    * @return the rotated vector
    */
   public static Vector<Integer> rotateVector(Vector<Integer> v, int n) {
-    Vector<Integer> ret = new Vector<Integer>();
-
-    for (int i = n; i < v.size(); i++) {
-      ret.add(v.get(i));
-    }
-    for (int i = 0; i < n; i++) {
-      ret.add(v.get(i));
-    }
+    Vector<Integer> ret = new Vector<Integer>(v);
+    Collections.rotate(ret, -n);
     return ret;
   }
 
@@ -96,14 +83,9 @@ public static Vector<Integer> rotateVector(Vector<Integer> v, int n) {
    */
   public static Vector<Integer> mergeVectors(Vector<Integer> v1,
       Vector<Integer> v2) {
-    Vector<Integer> ret = new Vector<Integer>();
-
-    for (int i = 0; i < v1.size(); i++) {
-      ret.add(v1.get(i));
-    }
-    for (int i = 0; i < v2.size(); i++) {
-      ret.add(v2.get(i));
-    }
+    Vector<Integer> ret = new Vector<Integer>(v1.size() + v2.size());
+    ret.addAll(v1);
+    ret.addAll(v2);
     return ret;
   }
-}
+}

app/src/main/java/generator/GenVector.java

@@ -24,4 +24,4 @@ public static Vector<Integer> generateVector(int n, int m) {
     // Convert back to vector if the return type must be Vector.
     return new Vector<>(ret); 
   }
-}
+}

gradle/libs.versions.toml

@@ -7,4 +7,4 @@ junit-jupiter = "5.10.0"
 
 [libraries]
 guava = { module = "com.google.guava:guava", version.ref = "guava" }
-junit-jupiter = { module = "org.junit.jupiter:junit-jupiter", version.ref = "junit-jupiter" }
+junit-jupiter = { module = "org.junit.jupiter:junit-jupiter", version.ref = "junit-jupiter" }

settings.gradle.kts

@@ -7,8 +7,8 @@
 
 plugins {
     // Apply the foojay-resolver plugin to allow automatic download of JDKs
-    id("org.gradle.toolchains.foojay-resolver-convention") version "0.7.0"
+    id("org.gradle.toolchains.foojay-resolver-convention") version "0.8.0"
 }
 
 rootProject.name = "run-java"
-include("app")
+include("app")