From ae911ea1dc7808b52b674736daac577e03f374b9 Mon Sep 17 00:00:00 2001 From: Reborn Date: Thu, 20 Mar 2025 16:37:37 +0000 Subject: [PATCH] insertion sort right --- .../InsertionSort/src/InsertionSort/InsertionSort.java | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/InsertionSort/InsertionSort/src/InsertionSort/InsertionSort.java b/Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/InsertionSort/InsertionSort/src/InsertionSort/InsertionSort.java index 896b372..c833a23 100644 --- a/Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/InsertionSort/InsertionSort/src/InsertionSort/InsertionSort.java +++ b/Course Activities/02 - Core CS/05 - Core theory/01 - Divide and Conquer, Sorting and Searching, and Randomized Algorithm/InsertionSort/InsertionSort/src/InsertionSort/InsertionSort.java @@ -7,11 +7,11 @@ public class InsertionSort { int j = limiter; int border = arr[limiter]; while (limiter>=i && border < arr[limiter-i]) { - arr[j] = arr[j-1]; - arr[j-1] = border; + arr[j] = arr[limiter-i]; i++; j--; } + arr[j] = border; } return arr;