added ws202425 courses

2024_Praxis_der_Programmierung/ue8/loesung/Gcd.java

@@ -0,0 +1,32 @@
+
+public class Gcd{
+
+
+	 public static int gcd(int num, int denom){
+		int x = num;
+		int y = denom;
+
+		// Sonderfall abfangen
+		if (x == 0)
+			return y;
+		if (y == 0)
+		 	return x;
+
+		// Endlosschleife vermeiden
+		if (x < 0)
+		  x = -x;
+		if (y < 0) 
+		  y = -y;
+
+		// Algorithmus von Euklid	 
+		while (x != y) {
+		  if (x > y)
+			x = x - y;
+		  else
+			y = y - x;
+		}
+		return x;
+	}
+
+
+}