From a0d41fb6587ab4a83596ce90be07ffb8fe39daa3 Mon Sep 17 00:00:00 2001 From: student <3024753@stud.th-mannheim.de> Date: Wed, 25 Mar 2026 13:16:15 +0100 Subject: [PATCH] Insertionsort + Test JUnit --- PR2pvl/src/Bubblesort.java | 89 +++++++++++++++++++++++++++++++++++++- PR2pvl/src/bubbletest.java | 17 ++++++++ 2 files changed, 105 insertions(+), 1 deletion(-) create mode 100644 PR2pvl/src/bubbletest.java diff --git a/PR2pvl/src/Bubblesort.java b/PR2pvl/src/Bubblesort.java index 7a45588..5c91d0b 100644 --- a/PR2pvl/src/Bubblesort.java +++ b/PR2pvl/src/Bubblesort.java @@ -1,4 +1,91 @@ +import java.util.Arrays; public class Bubblesort { -/// Hier soll bubblesort rein + + + public static void main(String[] args) { + + + + } + public static void bubblesort(int[] arr) { + + boolean ready = false; + + while (!ready) { + ready = true; + + for (int i = 0; i < arr.length -1; i++) { + + if (arr[i] > arr[i+1]) { + ready = false; + + int m = arr[i]; + arr[i] = arr[i+1]; + arr[i+1] = m; + } // if + + } // for + + System.out.println(Arrays.toString(arr)); + } // while + } + + + +public static int[] insertionSort(int[] sortieren) { + int temp = 0; + + for(int i = 1; i < sortieren.length; i++) { + if(sortieren[i-1] > sortieren[i]) { + temp=sortieren[i]; + sortieren[i]=sortieren[i-1]; + sortieren[i-1]=temp; + + int j = i; + while(j>0) { + if(sortieren[j-1]>sortieren[j]) { + temp=sortieren[j]; + sortieren[j]=sortieren[j-1]; + sortieren[j-1]=temp; + } + j--; + + } + } + } + + + + + return sortieren; } + +public static int[] insertionSortLSG(int[] sortieren) { + int temp; + for (int i = 1; i < sortieren.length; i++) { + temp = sortieren[i]; + int j = i; + while (j > 0 && sortieren[j - 1] > temp) { + sortieren[j] = sortieren[j - 1]; + j--; + } + sortieren[j] = temp; + } + return sortieren; +} + + + +} // End of Class + + + + + + + + + + + diff --git a/PR2pvl/src/bubbletest.java b/PR2pvl/src/bubbletest.java new file mode 100644 index 0000000..618291e --- /dev/null +++ b/PR2pvl/src/bubbletest.java @@ -0,0 +1,17 @@ +import static org.junit.jupiter.api.Assertions.*; + +import org.junit.jupiter.api.Test; + +class bubbletest { + + @Test + void test() { + + int arr[] = {3,2,5}; + int fin[]= {2,3,5}; + int erg[] = Bubblesort.insertionSort(arr); + + assertArrayEquals(erg, fin); + } + +}