beppe/javaSorts
1
0
Fork 0
mirror of https://github.com/bvanroll/javaSorts.git synced 2025-08-29 03:22:41 +00:00
Code Issues Packages Projects Releases Wiki Activity

last index gets remembered now during insertion sort

Browse Source
This commit is contained in:
Beppe Vanrolleghem
2020-01-17 22:59:44 +01:00
parent 8b0269445f
commit fbf95c61f0
1 changed files with 22 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
src/com/beppe/sorts/insertionSort.java
View File

@@ -2,21 +2,33 @@ package com.beppe.sorts;
public class insertionSort {
public static void Sort(int[] arrayToSort, int accumulator) {
public static void Sort(int[] arrayToSort, int accumulator, int lastIndex) {
if (accumulator == arrayToSort.length-1) return;
if (arrayToSort[accumulator] <= arrayToSort[accumulator+1]) Sort(arrayToSort, accumulator+1);
else {
int curr = arrayToSort[accumulator];
int next = arrayToSort[accumulator+1];
arrayToSort[accumulator+1] = curr;
arrayToSort[accumulator] = next;
if (accumulator != 0) Sort(arrayToSort, accumulator-1);
else Sort(arrayToSort, accumulator);
if (lastIndex != -1) {
if (arrayToSort[accumulator] > arrayToSort[accumulator+1]) {
int curr = arrayToSort[accumulator];
int next = arrayToSort[accumulator+1];
arrayToSort[accumulator+1] = curr;
arrayToSort[accumulator] = next;
if (accumulator != 0) Sort(arrayToSort, accumulator-1, lastIndex);
else Sort(arrayToSort, lastIndex, -1);
}
} else {
if (arrayToSort[accumulator] <= arrayToSort[accumulator+1]) Sort(arrayToSort, accumulator+1, -1);
else {
int curr = arrayToSort[accumulator];
int next = arrayToSort[accumulator+1];
arrayToSort[accumulator+1] = curr;
arrayToSort[accumulator] = next;
if (accumulator != 0) Sort(arrayToSort, accumulator-1, accumulator);
else Sort(arrayToSort, accumulator, -1);
}
}
}
public static void Sort(int[] arrayToSort) {
Sort(arrayToSort, 0);
Sort(arrayToSort, 0, -1);
}
}