3027822
/
Qualifier
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fertig

main
mail 2026-03-28 16:41:05 +01:00
parent fe10a94d3b
commit eaa8aa4a5f
1 changed files with 17 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
PR Gitty Qualifier/src/SortAlgo.java
View File

@ -2,8 +2,8 @@
public class SortAlgo {
public static void main (String[] args) {
int[] bubble = {6,3,1,5,2,4};
int[] select = {3,6,1,5,2,4};
int[] bubble = {6,5,4,3,2,1};
int[] select = {6,5,4,3,2,1};
int[] insert = {3,6,1,5,2,4};
int[] erg1 = bubblesort(bubble);
@ -18,15 +18,15 @@ public class SortAlgo {
System.out.println();
//int[] erg3 = insertionsort(insert);
//for (int i = 0; i < erg3.length;i++)
//System.out.print(erg3[i] + " ");
int[] erg3 = insertionsort(insert);
for (int i = 0; i < erg3.length;i++)
System.out.print(erg3[i] + " ");
}
public static int[] bubblesort (int[] arr) {
int temp = -1;
for (int i = 0; i < arr.length - 1;i++) {
for (int a = 0; a < arr.length - 1;a++) {
for (int a = 0; a < arr.length -1 ;a++) {
if (arr[a] > arr[a+1]) {
temp = arr[a+1];
arr[a+1] = arr[a];
@ -54,6 +54,17 @@ public class SortAlgo {
}
public static int[] insertionsort (int[] arr) {
for (int i = 0; i < arr.length - 1 ;i++) {
if (arr[i+1] < arr[i]) {
int m = arr[i+1];
int j = i;
while (j >= 0 && arr[j] > m) {
arr[j+1] = arr[j];
j--;
}
arr[j+1] = m;
}
}
return arr;
}
}