fix(7.5): i reaches 2nd-to-last index of Array/ArrayList

- i (the current index) for selection sort doesn't need to reach the last index of the array
101zh · Jan 9, 2024 · 6a6afd0 · 6a6afd0
1 parent a4fa079
commit 6a6afd0
Show file tree

Hide file tree

Showing 2 changed files with 13 additions and 15 deletions.
diff --git a/src/main/java/Unit7/U7_L5_Activity_One.java b/src/main/java/Unit7/U7_L5_Activity_One.java
@@ -4,7 +4,7 @@
 
 public class U7_L5_Activity_One {
     public static void sortAndPrintReverse(String[] arr) {
-        for (int i = 0; i < arr.length; i++) {
+        for (int i = 0; i < arr.length - 1; i++) {
             int high = i;
             for (int j = i + 1; j < arr.length; j++) {
                 if (arr[j].compareTo(arr[high]) > 0) {

diff --git a/src/main/java/Unit7/U7_L5_Activity_Two.java b/src/main/java/Unit7/U7_L5_Activity_Two.java
@@ -4,27 +4,25 @@
 
 import java.util.ArrayList;
 
-public class U7_L5_Activity_Two
-{
-
-  public static void selectSortReverse(ArrayList<Integer> list){
-
-    for(int i=0; i<list.size(); i++){
-      int largestIndex=i;
-      for(int j=i+1; j<list.size(); j++){
-        if(list.get(j)>list.get(largestIndex)){
-          largestIndex=j;
+public class U7_L5_Activity_Two {
+
+  public static void selectSortReverse(ArrayList<Integer> list) {
+
+    for (int i = 0; i < list.size() - 1; i++) {
+      int largestIndex = i;
+      for (int j = i + 1; j < list.size(); j++) {
+        if (list.get(j) > list.get(largestIndex)) {
+          largestIndex = j;
         }
       }
       int temp = list.get(i);
-      
+
       list.set(i, list.get(largestIndex));
       list.set(largestIndex, temp);
     }
-    
+
     System.out.println(list);
-    
+
   }
 
 }
-