Merge branch 'code-differently:main' into feat/lesson06/expression_calculator

Author: Wayleom-Rubio

lesson_04/danielsonadjocy/.gitattributes

@@ -0,0 +1,12 @@
+#
+# https://help.github.com/articles/dealing-with-line-endings/
+#
+# Linux start script should use lf
+/gradlew        text eol=lf
+
+# These are Windows script files and should use crlf
+*.bat           text eol=crlf
+
+# Binary files should be left untouched
+*.jar           binary
+

lesson_04/danielsonadjocy/.gitignore

@@ -0,0 +1,5 @@
+# Ignore Gradle project-specific cache directory
+.gradle
+
+# Ignore Gradle build output directory
+build

lesson_04/danielsonadjocy/README.md

@@ -0,0 +1,101 @@
+## Python implementation
+
+```python
+def is_prime(num):
+    if num <= 1:
+        return False
+    for val in range(2,int(num**(1/2))+1):
+        if num % val == 0:
+            return False
+    return True
+
+if __name__ == "__main__":
+    print(4, is_prime(4))
+    print(13, is_prime(13))
+    for num in range(2, 101):
+        print(str(num) +": "+ str(is_prime(num)))
+```
+
+## Java implementation
+
+```java
+public class Prime {
+  public static void main(String[] args) {
+    System.out.println(4 + " " + isPrime(4));
+    System.out.println(13 + " " + isPrime(13));
+
+    // Checks each number between 2 and 100 to see if they're prime.
+    for (int num = 2; num <= 100; num++) {
+      System.out.println(num + ": " + isPrime(num));
+    }
+  }
+
+  /**
+   * Checks if num is a prime number.
+   *
+   * @param num the number to check
+   * @return true if num is prime, false otherwise
+   */
+  public static boolean isPrime(int num) {
+    if (num <= 1){
+        return false;
+    }
+    for (int val = 2; val <= Math.sqrt(num); val++) {
+      if (num % val == 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+}
+
+```
+
+## Explanation
+In the Python file `prime.py`, the function `is_prime` takes the parameter called `num` and returns `True` or `False` depending on whether or not num is a prime number (as in numbers that are only divisble by another number that is not 1 or itself). The function runs a loop through all numbers in the range from 2 to the square root of num inclusively, divides num by each of those numbers, and if the remainder is ever 0, then false is returned immediately. If all numbers are checked without getting 0, true is returned after the loop.
+
+In the Java file `Prime.java`, the function `isPrime` also takes a parameter called `num` and has the same goal as the python iteration. The java version returns `true` when given a prime number and `false` when given a non-prime using the same logic as the python version.
+
+### Differences
+
+1. **Syntax**: 
+   - In Python, functions are defined using the `def` keyword. Meanwhile in Java the function is defined with `public static <return type>`
+   - Python uses `True` and `False` for boolean values, while Java uses `true` and `false`.
+   - For loop in python are written `for x in range(2, num**(1/2)+1).` Since the end point is exclusive, we need to add one to make sure that the square root of the num is included.
+   - The java for loop is written like `for (int x = 2; x<=Math.sqrt(num); x++)`. This creates x with a value of 2, loops until it's greater than the root of num and adds one to x for the next iteration.
+
+2. **Type Coercion**:
+   - JavaScript has type coercion, which can sometimes lead to unexpected results if the input is not properly handled. In contrast, Python is more strict with types.
+   
+3. **Function Calls**:
+   - Most function calls between Python and Java are done the same. However for printing to the console, Python uses `print()` and Java uses `System.out.println()`.
+
+## Test Cases
+
+Both the Python and Java implementations include automated tests to verify that the `is_prime` function works correctly.
+
+- **Python (`prime_test.py`)**:  
+  The test file uses Python’s `unittest` framework. It checks if the function returns `True` for prime numbers and `False` for non-prime numbers.  
+  ```python
+  self.assertTrue(is_prime(13))  # Checks that 13 is correctly identified as a prime number.
+  ```
+
+- **Java (`isPrimeTest.java`)**:  
+  The test file uses JUnit. It also checks that the function returns the correct answers.
+  ```java
+  assertTrue(Prime.isPrime(13)); // Checks that 13 is correctly identified as a prime number.
+  ```
+
+### How to run the tests
+
+- **Python:**  
+  From the `danielsonadjocy` directory, run:  
+  ```bash
+  python -m unittest app.src.test.python.prime_test
+  ```
+
+- **Java:**  
+  Make sure JUnit is available. From the `danielsonadjocy` directory, compile and run:  
+  ```bash
+  gradle test
+  ```

lesson_04/danielsonadjocy/app/build.gradle

@@ -0,0 +1,45 @@
+/*
+ * This file was generated by the Gradle 'init' task.
+ *
+ * This generated file contains a sample Java application project to get you started.
+ * For more details on building Java & JVM projects, please refer to https://docs.gradle.org/9.0.0/userguide/building_java_projects.html in the Gradle documentation.
+ * This project uses @Incubating APIs which are subject to change.
+ */
+
+plugins {
+    // Apply the application plugin to add support for building a CLI application in Java.
+    id 'application'
+}
+
+repositories {
+    // Use Maven Central for resolving dependencies.
+    mavenCentral()
+}
+
+dependencies {
+    // This dependency is used by the application.
+    implementation libs.guava
+    testImplementation 'org.junit.jupiter:junit-jupiter:5.10.0'
+}
+
+testing {
+    suites {
+        // Configure the built-in test suite
+        test {
+            // Use JUnit Jupiter test framework
+            useJUnitJupiter('5.12.1')
+        }
+    }
+}
+
+// Apply a specific Java toolchain to ease working on different environments.
+java {
+    toolchain {
+        languageVersion = JavaLanguageVersion.of(22)
+    }
+}
+
+application {
+    // Define the main class for the application.
+    mainClass = 'org.example.App'
+}

lesson_04/danielsonadjocy/app/src/main/java/org/example/Prime.java

@@ -0,0 +1,29 @@
+public class Prime {
+  public static void main(String[] args) {
+    System.out.println(4 + " " + isPrime(4));
+    System.out.println(13 + " " + isPrime(13));
+
+    // Checks each number between 2 and 100 to see if they're prime.
+    for (int num = 2; num <= 100; num++) {
+      System.out.println(num + ": " + isPrime(num));
+    }
+  }
+
+  /**
+   * Checks if num is a prime number.
+   *
+   * @param num the number to check
+   * @return true if num is prime, false otherwise
+   */
+  public static boolean isPrime(int num) {
+    if (num <= 1){
+        return false;
+    }
+    for (int val = 2; val <= Math.sqrt(num); val++) {
+      if (num % val == 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+}

lesson_04/danielsonadjocy/app/src/main/python/__init__.py

@@ -0,0 +1,23 @@
+def is_prime(num):
+    """
+    Checks if num is a prime number.
+
+    Args:
+        num (int): The number to check.
+
+    Returns:
+        bool: True if num is prime, False otherwise.
+    """
+    if num <= 1:
+        return False
+    for val in range(2,int(num**(1/2))+1):
+        if num % val == 0:
+            return False
+    return True
+
+if __name__ == "__main__":
+    print(4, is_prime(4))
+    print(13, is_prime(13))
+    # Checks each number between 2 and 100 to see if they're prime.
+    for num in range(2, 101):
+        print(str(num) +": "+ str(is_prime(num)))

lesson_04/danielsonadjocy/app/src/main/python/prime.py

@@ -0,0 +1,24 @@
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+
+
+import org.junit.jupiter.api.Test;
+
+public class isPrimeTest {
+
+  @Test
+  void testPrime() {
+    int[] nums = {2, 3, 7, 13, 71, 79, 613};
+    for (int num : nums){
+        assertTrue(Prime.isPrime(num), num + " is a prime number");
+    }
+  }
+
+  @Test
+  void testnotPrime() {
+    int[] nums = {1, 4, 6, 14, 44, 50, 82};
+    for (int num : nums){
+        assertFalse(Prime.isPrime(num), num + " is not a prime number");
+    }
+  }
+}

lesson_04/danielsonadjocy/app/src/test/java/org/example/isPrimeTest.java

@@ -0,0 +1,19 @@
+import unittest
+from app.src.main.python.prime import is_prime
+
+
+class TestPrime(unittest.TestCase):
+    """Unit tests for the prime number checker."""
+
+    def test_is_prime(self):
+        for x in [2, 3, 7, 13, 71, 79, 613]:
+            self.assertTrue(is_prime(x), str(x) + " should be prime")
+
+
+    def test_is_not_prime(self):
+        for x in [1, 4, 6, 14, 44, 50, 82]:
+            self.assertFalse(is_prime(x), str(x) + " is not prime")
+        
+
+if __name__ == "__main__":
+    unittest.main()