From b9d1c4512f99755fc70f7f873fcf38c8f10175a3 Mon Sep 17 00:00:00 2001
From: TurinTech Bot <bot@turintech.ai>
Date: Thu, 19 Dec 2024 11:38:45 +0000
Subject: [PATCH] Artemis Changes

---
 app/src/main/java/control/Double.java | 38 +++++++++++----------------
 1 file changed, 16 insertions(+), 22 deletions(-)

diff --git a/app/src/main/java/control/Double.java b/app/src/main/java/control/Double.java
index cc5cf15..2c6b550 100644
--- a/app/src/main/java/control/Double.java
+++ b/app/src/main/java/control/Double.java
@@ -10,11 +10,7 @@ public class Double {
   public static int sumSquare(int n) {
     int sum = 0;
     for (int i = 0; i < n; i++) {
-      for (int j = 0; j < n; j++) {
-        if (i == j) {
-          sum = sum + i * j;
-        }
-      }
+      sum += i * i;
     }
     return sum;
   }
@@ -27,10 +23,8 @@ public static int sumSquare(int n) {
    */
   public static int sumTriangle(int n) {
     int sum = 0;
-    for (int i = 0; i < n + 1; i++) {
-      for (int j = 0; j < i; j++) {
-        sum = sum + j;
-      }
+    for (int i = 1; i <= n; i++) {
+      sum += i * (i - 1) / 2;
     }
     return sum;
   }
@@ -45,20 +39,21 @@ public static int sumTriangle(int n) {
    */
   public static int countPairs(int[] arr) {
     int count = 0;
-    for (int i = 0; i < arr.length; i++) {
-      int nDuplicates = 0;
-      for (int j = 0; j < arr.length; j++) {
-        if (arr[i] == arr[j]) {
-          nDuplicates++;
-        }
-      }
-      if (nDuplicates == 2) {
+    int[] counts = new int[1001]; // Assuming values are within 0-1000
+
+    for (int num : arr) {
+      counts[num]++;
+    }
+
+    for (int c : counts) {
+      if (c == 2) {
         count++;
       }
     }
     return count / 2;
   }
 
+
   /**
    * Counts the number of instances where the values at the same index are equal
    *
@@ -69,11 +64,10 @@ public static int countPairs(int[] arr) {
    */
   public static int countDuplicates(int[] arr0, int[] arr1) {
     int count = 0;
-    for (int i = 0; i < arr0.length; i++) {
-      for (int j = 0; j < arr1.length; j++) {
-        if (i == j && arr0[i] == arr1[j]) {
-          count++;
-        }
+    int minLength = Math.min(arr0.length, arr1.length);
+    for (int i = 0; i < minLength; i++) {
+      if (arr0[i] == arr1[i]) {
+        count++;
       }
     }
     return count;