insertionsort
This commit is contained in:
@ -1,10 +1,13 @@
|
|||||||
package de.redstoneunion.git.MrGeorgen.timsort;
|
package de.redstoneunion.git.MrGeorgen.timsort;
|
||||||
|
|
||||||
|
import java.util.Arrays;
|
||||||
|
|
||||||
import de.redstoneunion.git.MrGeorgen.timsort.timsort;
|
import de.redstoneunion.git.MrGeorgen.timsort.timsort;
|
||||||
|
|
||||||
public class test {
|
public class test {
|
||||||
public static void main(String[] args) {
|
public static void main(String[] args) {
|
||||||
int[] array = {3, 3};
|
int[] array = {0, 3, -1, -3, -6, -6, 10, 10, 789, 456};
|
||||||
timsort.insertionsort(array);
|
int[] output = timsort.insertionsort(array);
|
||||||
|
System.out.println(Arrays.toString(output));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@ -17,6 +17,10 @@ public class timsort {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
System.out.println(unsorted[i] + ":" + minIndex);
|
System.out.println(unsorted[i] + ":" + minIndex);
|
||||||
|
for(int j = i; j > minIndex; --j) {
|
||||||
|
output[j] = output[j - 1];
|
||||||
|
}
|
||||||
|
output[minIndex] = unsorted[i];
|
||||||
}
|
}
|
||||||
return output;
|
return output;
|
||||||
}
|
}
|
||||||
|
|||||||
Reference in New Issue
Block a user