Compare commits

..

2 Commits

Author SHA1 Message Date
student aa78d2efea LinkedList Test erweitert 2026-04-01 13:48:59 +02:00
student 27d0058226 Verbesserung am Test 2026-04-01 13:47:19 +02:00
3 changed files with 11 additions and 9 deletions

View File

@ -16,6 +16,10 @@ class LinkedListTest {
L.einfuegenAmEnde(8); L.einfuegenAmEnde(8);
L.einfuegenAmEnde(7); L.einfuegenAmEnde(7);
Assert.assertNotSame(3, L.auslesenAnPos(3));
Assert.assertNotSame(3, L.auslesenAnPos(5));
Assert.assertNotSame(3, L.auslesenAnPos(7));
Assert.assertNotSame(4, L.auslesenAnPos(6));
LinkedList R = new LinkedList(10); LinkedList R = new LinkedList(10);
@ -27,10 +31,10 @@ class LinkedListTest {
Assert.assertNotSame(3, R.auslesenAnPos(0)); Assert.assertNotSame(3, R.auslesenAnPos(0));
Assert.assertNotSame(3, R.auslesenAnPos(2)); Assert.assertNotSame(3, R.auslesenAnPos(2));
Assert.assertNotSame(3, R.auslesenAnPos(5));
Assert.assertNotSame(4, R.auslesenAnPos(2));
Assert.assertEquals(10, R.auslesenAnPos(0)); Assert.assertEquals(10, R.auslesenAnPos(0));
Assert.assertEquals(3, R.auslesenAnPos(1));
} }

View File

@ -8,7 +8,7 @@ public class RadixSort {
} }
//int Arr //int Arr
public static void radixSort(int[] arr) { public static int[] radixSort(int[] arr) {
int größteZ=arr[0]; int größteZ=arr[0];
//Buckets als Listen anlegen //Buckets als Listen anlegen
@ -72,6 +72,6 @@ public class RadixSort {
} }
return arr;
} }
} }

View File

@ -14,9 +14,7 @@ class RadixSortTest {
int[] sortS2 = {0,1,2,3,4,5,6,7,8,9,10,27}; int[] sortS2 = {0,1,2,3,4,5,6,7,8,9,10,27};
Assert.assertEquals(sortS, RadixSort.radixSort(sort)); Assert.assertEquals(sortS, RadixSort.radixSort(sort));
Assert.assertEquals(sortS, RadixSort.radixSort(sort)); Assert.assertEquals(sortS2, RadixSort.radixSort(sort2));
Assert.assertArrayEquals(sortS2, RadixSort.radixSort(sort2));
} }