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

removed test prints

Browse Source
This commit is contained in:
MrGeorgen
2021-01-02 12:50:54 +01:00
parent b87da63d8c
commit 281c23c8d4
1 changed files with 0 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -66,9 +66,7 @@ public class timsort {
}
int[][] notMerged = new int[runs.size()][];
for(int i = 0; i < runs.size(); ++i) {
System.out.println("Runs before insertionsort: " + Arrays.toString(runs.get(i)));
notMerged[i] = insertionsort(runs.get(i));
System.out.println("After insertionsort: " + Arrays.toString(notMerged[i]));
}
return merge(notMerged)[0];
}
@ -91,7 +89,6 @@ public class timsort {
}
int lastW = w;
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(w == lastW) ++gallopingCounter;
@ -99,7 +96,6 @@ public class timsort {
}
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];
}
}