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

works properly

Browse Source
This commit is contained in:
MrGeorgen
2020-12-31 18:23:25 +01:00
parent 7d79ee3ec9
commit b38b75cb23
1 changed files with 9 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -77,17 +77,18 @@ public class timsort {
int[] temp = new int[notMerged[i].length + notMerged[i + 1].length];
merged[i / 2] = temp;
int[] j = new int[2];
for(int l = 0; l < temp.length; ++l) {
int w = notMerged[i][j[0]] > notMerged[i + 1][j[1]] ? 1 : 0;
int w = 0;
int l = 0;
for(; j[w] < notMerged[i + w].length; ++l) {
w = notMerged[i][j[0]] > notMerged[i + 1][j[1]] ? 1 : 0;
System.out.println("w: " + w);
temp[l] = notMerged[i + w][j[w]];
++j[w];
if(j[w] >= notMerged[i + w].length) {
int b = w != 0 ? 0 : 1;
for(int k = j[b]; k < notMerged[i + b].length; ++k, ++l) {
temp[l] = notMerged[i + b][k];
}
}
}
int b = w != 0 ? 0 : 1;
for(int k = j[b]; l < temp.length; ++k, ++l) {
System.out.println("Index: " + k + " length: " + notMerged[i + b].length);
temp[l] = notMerged[i + b][k];
}
}
if(notEvenLen == 1) merged[merged.length - 1] = notMerged[notMerged.length - 1];