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

vorbereitung

main
mail 2026-03-31 14:41:25 +02:00
parent 78557e8b60
commit cdeda87bcd
2 changed files with 24 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -26,6 +26,18 @@ public class SortAlgo {
int[] erg3 = insertionsort(insert);
for (int i = 0; i < erg3.length;i++)
System.out.print(erg3[i] + " ");
System.out.println();
int[] erg4 = mergesort(insert);
for (int i = 0; i < erg4.length;i++)
System.out.print(erg4[i] + " ");
System.out.println();
int[] erg5 = quicksort(insert);
for (int i = 0; i < erg5.length;i++)
System.out.print(erg5[i] + " ");
}
public static int[] bubblesort (int[] arr) {
@ -82,4 +94,14 @@ public class SortAlgo {
log.info("Anzahl der Durchläufe: " + d);
return arr;
}
public static int[] mergesort (int[] arr) { // O(n*log2(n))
return arr;
}
public static int[] quicksort (int[] arr) { // durchschnitt: O(n*log2(n))
// worst case : O(n^2)
return arr;
}
}

4
PR Gitty Qualifier/src/Tabelle.java
View File

@ -25,8 +25,8 @@ public class Tabelle {
}
// bestCase worstCase
//Bubblesort O(n^2) O(n^2)
//Selectionsort O(n) O(n^2)
//Bubblesort O(n) O(n^2)
//Selectionsort O(n^2) O(n^2)
//Insertionsort O(n) O(n^2)
//Zur Klärung der "Sockenfrage" berechnen Sie die Anzahl der Vergleiche für gute (n log n)!!! und