LinkedList Test erweitert

PR2pvl/src/LinkedListTest.java

@@ -16,6 +16,10 @@ class LinkedListTest {
 		L.einfuegenAmEnde(8);
 		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);
@@ -27,10 +31,10 @@ class LinkedListTest {
 		
 		Assert.assertNotSame(3, R.auslesenAnPos(0));
 		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(3, R.auslesenAnPos(1));
-		
-		
 		
 		
 	}

PR2pvl/src/RadixSort.java

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

PR2pvl/src/RadixSortTest.java

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