MrGeorgen/timsort
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

reverse descending

Browse Source
This commit is contained in:
MrGeorgen
2020-12-26 20:03:06 +01:00
parent a06dd33ca8
commit 94808c7cc6
1 changed files with 18 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
src/main/java/de/redstoneunion/git/MrGeorgen/timsort/timsort.java
View File

@ -39,15 +39,30 @@ public class timsort {
int j = i;
boolean ascending = true;
boolean descending = true;
boolean ascendingCache = false;
boolean descendingCache = false;
for(; i < unsorted.length - 1 && (ascending || descending); ++i) {
ascendingCache = ascending;
descendingCache = descending;
ascending = ascending && unsorted[i] <= unsorted[i + 1];
descending = descending && unsorted[i] >= unsorted[i + 1];
}
if(i - j < minRun) i = j + minRun;
if(i >= unsorted.length - 1) i = unsorted.length;
runs.add(Arrays.copyOfRange(unsorted, j, i));
boolean minRunNotMet = i >= unsorted.length - 1;
if(minRunNotMet) i = unsorted.length;
int[] temp1 = Arrays.copyOfRange(unsorted, j, i);
if(!ascendingCache && descendingCache && !minRunNotMet) {
// reverses the array
int l, temp;
for(l = 0; l < temp1.length / 2; l++) {
temp = temp1[l];
temp1[l] = temp1[temp1.length - l - 1];
temp1[temp1.length - l - 1] = temp;
}
}
runs.add(temp1);
}
int[][] notMerged= new int[runs.size()][];
int[][] notMerged = new int[runs.size()][];
for(int i = 0; i < runs.size(); ++i) {
notMerged[i] = insertionsort(runs.get(i));
}