RadixSort Test versuch

PR2pvl/src/Knoten.java

@@ -11,9 +11,11 @@ public class Knoten {
 	
 	
 	public void einfuegenAmEnde(int wert) {
-		if(this.nachfolger != null) {
+		if(this.nachfolger == null) {
 			Knoten k = new Knoten(wert);
 			this.nachfolger=k;
+		}else {
+		nachfolger.einfuegenAmEnde(wert);
 		}
 	}
 	
@@ -41,6 +43,7 @@ public class Knoten {
 			nachfolger.auslesenAnPos(pos);
 			}
 		}
+		return r;
 		
 		
 		

PR2pvl/src/LinkedListTest.java

@@ -28,7 +28,8 @@ class LinkedListTest {
 		Assert.assertNotSame(3, R.auslesenAnPos(0));
 		Assert.assertNotSame(3, R.auslesenAnPos(2));
 		Assert.assertEquals(10, R.auslesenAnPos(0));
-		Assert.assertEquals(4, R.auslesenAnPos(2));
+		Assert.assertEquals(3, R.auslesenAnPos(1));
+		
 		
 		
 		

PR2pvl/src/RadixSortTest.java

@@ -0,0 +1,24 @@
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.Assert;
+import org.junit.jupiter.api.Test;
+
+class RadixSortTest {
+
+	@Test
+	void test() {
+		int[] sort = {9,8,7,6,5,4,3,2,1,0};
+		int[] sortS = {0,1,2,3,4,5,6,7,8,9};
+		
+		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));
+		
+		
+	}
+
+}