added ws202425 courses

2024_Praxis_der_Programmierung/ue11/loesung/Hash.java

@@ -0,0 +1,22 @@
+
+import java.util.*; //hashset, linked liste auch hier
+
+public class Hash{
+	
+	
+	public static void main(String args[]){
+		Set<String> a = new HashSet<String>();
+		a.add("Aal");
+		a.add("Tanne");
+		a.add("Birke");
+		a.add("Baum");
+
+		Iterator<String> iter = a.iterator();
+		while (iter.hasNext()) {
+			String s = iter.next();
+			System.out.println(s);		
+		}
+	}
+}
+
+

2024_Praxis_der_Programmierung/ue11/loesung/Pair.java

@@ -0,0 +1,23 @@
+
+
+public class Pair<T1, T2>{
+	T1 first;
+	T2 second;
+
+
+	Pair(T1 first, T2 second){
+		this.first = first;
+		this.second = second;	
+	}
+
+	T1 getFirst(){
+		return this.first;
+	}
+
+
+	T2 getSecond(){
+		return this.second;
+	}
+
+
+}

2024_Praxis_der_Programmierung/ue11/loesung/PairComp.java

@@ -0,0 +1,36 @@
+
+import java.util.*;
+
+
+public class PairComp<T1 extends Number, T2 extends Number> implements Comparable<PairComp<T1,T2>> {
+	T1 first;
+	T2 second;
+
+
+	PairComp(T1 first, T2 second){
+		this.first = first;
+		this.second = second;	
+	}
+
+	T1 getFirst(){
+		return this.first;
+	}
+
+
+	T2 getSecond(){
+		return this.second;
+	}
+	
+	@Override
+	public int compareTo(PairComp<T1,T2> other){
+		if (this.getFirst().doubleValue() < other.getFirst().doubleValue()){
+			return -1;
+		}
+		if (this.getFirst().doubleValue() > other.getFirst().doubleValue()){
+			return 1;
+		}
+		return 0;
+		
+	}
+
+}

2024_Praxis_der_Programmierung/ue11/loesung/TestPair.java

@@ -0,0 +1,16 @@
+
+
+public class TestPair{
+
+
+	public static void main (String args[]){
+		Pair<Integer, Integer> p = new Pair<Integer, Integer>(6,2);
+		System.out.println(p.getFirst());
+		System.out.println(p.getSecond());
+
+		Pair<Double, Integer> p2 = new Pair<Double, Integer>(6.0,2);
+		System.out.println(p2.getFirst());
+		System.out.println(p2.getSecond());
+	}
+
+}

2024_Praxis_der_Programmierung/ue11/loesung/TestPairComp.java

@@ -0,0 +1,18 @@
+
+
+public class TestPairComp{
+
+
+	public static void main (String args[]){
+		PairComp<Integer, Integer> p1 = new PairComp<Integer, Integer>(6,2);
+		System.out.println(p1.getFirst());
+		System.out.println(p1.getSecond());
+
+		PairComp<Integer, Integer> p2 = new PairComp<Integer, Integer>(2,3);
+		System.out.println(p2.getFirst());
+		System.out.println(p2.getSecond());
+
+		System.out.println(p1.compareTo(p2));
+	}
+
+}

2024_Praxis_der_Programmierung/ue11/loesung/Tree.java

@@ -0,0 +1,22 @@
+
+import java.util.*; //hashset, linked liste auch hier
+
+public class Tree{
+	
+	
+	public static void main(String args[]){
+		Set<String> a = new TreeSet<String>();
+		a.add("Aal");
+		a.add("Tanne");
+		a.add("Birke");
+		a.add("Baum");
+
+		Iterator<String> iter = a.iterator();
+		while (iter.hasNext()) {
+			String s = iter.next();
+			System.out.println(s);		
+		}
+	}
+}
+
+