TDR/notselctionsort
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

refactor: format java files

Browse Source
This commit is contained in:
Ture Bentzin 2025-11-20 17:11:13 +00:00
parent 103312d261
commit ce8fd497e8
No known key found for this signature in database
GPG Key ID: F1E670A1ED8E92CE
1 changed files with 8 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
Sort.java
View File

@ -7,24 +7,22 @@ public class Sort {
while (array.length != 0) {
int indexKleinstesElement = 0;
for (int index = 1; index < array.length; index++) {
if (array[index] < array[indexKleinstesElement]) indexKleinstesElement = index;
}
for (int index = 1; index < array.length; index++)
if (array[index] < array[indexKleinstesElement])
indexKleinstesElement = index;
// Add to hilfsarray (at curr pos)
hilfsArray[hilfsArray.length - array.length] = array[indexKleinstesElement];
System.out.println("Sortiere.... hilfsarray: " + Arrays.toString(hilfsArray) + " array: " + Arrays.toString(array));
System.out
.println("Sortiere.... hilfsarray: " + Arrays.toString(hilfsArray) + " array: " + Arrays.toString(array));
// Refill array
int[] newArray = new int[array.length - 1];
// i = index in array, j = index in newArray
for (int i = 0, j = 0; i < array.length; i++ ) {
if (i != indexKleinstesElement) {
newArray[j] = array[i];
j++;
}
}
for (int i = 0, j = 0; i < array.length; i++)
if (i != indexKleinstesElement)
newArray[j++] = array[i];
array = newArray;
}
return hilfsArray;