Merge branch 'code-differently:main' into feature/lesson_06

Author: AmiyahJo

lesson_04/chigazograham/README.md

@@ -0,0 +1,70 @@
+## Python implementation
+
+```python
+def is_prime(num): 
+# uses the function is_prime and takes the argument num
+    if num > 1: 
+# gets rid of numbers 1 and lower as the first prime number is 2
+        for i in range(2, (num // 2) + 1):
+# tells the computer to look at all numbers between 2 and half of the value of num rounded up to the next nearest value using floor division
+            if(num % i) == 0: 
+# then divides the num value, using modulo division, by every number in the range of two to +infinity 
+            return False 
+# if the remainder in equivalent to 0 then the number is not prime and returns False
+        else:
+            return True 
+# if the remaineder is not equivalent to 0 then the terminal will return True     
+    else:
+        return False
+# for all other real numbers that arent prime the terminal will reurn False
+
+print(is_prime(19)) #Output: True
+print(is_prime(9)) #Output: False
+```
+
+## Ruby implementation
+
+```ruby
+def isPrime(n) 
+#uses the function isPrime and takes the argument n
+    return false if n <= 1 
+#the computer will reurn false for all numbers less than or equal to zero
+    return true if n == 2 || n == 3 
+#tells the computer to return true if the n is equivalent to 2 or 3
+
+    return false if n % 2 == 0 || n % 3 == 0 
+#returns false if n is divisible by two or 3
+
+    i = 5 
+#defines i  starting value as 5
+    while i * i <= n 
+#while n is greater than or equal to 25
+        return false if n % i == 0 || n % (i + 2) == 0 
+#return false if n is divisible by 5 or 7
+        i += 6 
+#adds 6 to the value of i if n is not divisible by 5 or 7 and runs the loop again
+    end    
+    true 
+#returns true for all numbers that arent divisible by 2, 3, 5, or 7
+end
+puts isPrime(17) #Output: true
+puts isPrime(24) #Output: false
+```
+
+## Explanation
+
+The Python implementation uses a function named `is_prime` that takes a single argument `num`. It returns `False` if the number is 1 or less or divisible by any number from two to half the value of `num` (i.e., when the remainder of the division of the number by 2 is zero), otherwise, it returns `True` and returns any possible other values as false.
+
+The Ruby implementation uses a function named `isPrime` that also takes a single argument `n`. It returns `true` if the number is equivalent to 2 or 3 and if the number is not divisible by 2 or 3 and 5 or 7 if the number is over 25 and `false` if otherwise.
+
+### Differences
+
+1. **Syntax**: 
+   - Python uses `True` and `False` for boolean values, while Ruby uses `true` and `false`.
+   - The formatting for `if` statements are also different between the two. In Python, `if` statements have the initial statement and then on the next line the command to run if the variable falls under the `if` statement. In Ruby the formatting is completely different, the command comes first and after that the `if` statement comes in on the same line
+   - In Python, a colon(`:`) is used to close function statements, whereas in Ruby there is nothing closing the function statements.
+   - Ruby can return true or false without a return statement.  In contrast Python requires a return statement or will return with `None`.
+   - Ruby has to be closed in `end` after loops or an error will appear and the code won't run. Python, on the other hand doesn't need anything and will return with `None` instead of an error if not given further instructions.
+   - The syntax for calling functions and printing to the console/output is different. Python uses `print()`, while Ruby uses `puts()`.
+
+<!-- Used code from geeksforgeeks.org to assist in creating assignment -->

lesson_04/tommytran/lesson_4.java

@@ -0,0 +1,35 @@
+public class lesson_4 {
+
+    // Function to check if a number is prime
+    public static boolean isPrime(int n) {
+        if (n < 2) {
+            return false; // Numbers less than 2 are not prime
+        }
+        if (n == 2) {
+            return true; // 2 is the only even prime number
+        }
+        if (n % 2 == 0) {
+            return false; // Numbers divisible by 2 are not prime
+        }
+        // Loop that checks every odd number up to the square root of n
+        for (int i = 3; i <= Math.sqrt(n); i += 2) {
+            if (n % i == 0) {
+                return false; // n is divisible by i, so it's not prime
+            }
+        }
+        return true; // n is prime
+    }
+
+    public static void main(String[] args) {
+        // Declare integers in main method
+        int a = 1;
+        int b = 9;
+        int c = 17;
+
+        // Return string of whether or not int is a prime number
+        System.out.println("Is " + a + " a prime number? " + isPrime(a));
+        System.out.println("Is " + b + " a prime number? " + isPrime(b));
+        System.out.println("Is " + c + " a prime number? " + isPrime(c));
+    }
+}
+// code sourced from chat-gpt after converting my JS file.

lesson_04/tommytran/lesson_4.js

@@ -0,0 +1,29 @@
+   
+    //declare integers in function: sample numbers
+    let a = 1;
+    let b = 9;
+    let c = 17;
+{    
+function Prime(n) {
+    if (n < 2) {
+        return false; // Numbers less than 2 are not prime
+    }
+    if (n === 2) {
+        return true; // 2 is the only even prime number
+    }
+    if (n % 2 === 0) {
+        return false; // numbers divisible by 2 are not prime
+    }
+    // loop that checks every odd number up until square root of n
+    for (let i = 3; i <= Math.sqrt(n);i +=2) {
+        if (n % i === 0) {
+            return false; // n is divisible by i, so it's not prime 
+        }
+    }
+    return true; // n is prime
+}
+//return string of whether or not int is a prime number
+console.log(`Is ${a} a prime number? ${Prime(a)}`);
+console.log(`Is ${b} a prime number? ${Prime(b)}`);
+console.log(`Is ${c} a prime number? ${Prime(c)}`);
+}

lesson_04/tommytran/readme.md

@@ -0,0 +1,20 @@
+## Explanation
+
+
+First I declared 3 variables to use to test my function a,b, and c. I then assigned 3 integers to these variables to test this function. I created a function by the name of prime that contained an if else statement and a for loop. I then created several rules for the the if statement. The first rule determined whether the number was less than 2 then it was considered not a prime number. The second rule was that the number 2 would return true as it is the only even prime number. the third rule was that any number that was divided by 2 would not leave a remainder a 0. If none of those conditions were satisfied then a for loop would activate starting from the number 3. The loop would check all numbers starting at number #3 and must be less than or equal to the square root of (n). The loop would then increase integer by 2 to check every odd number between 3 and the square root. If any number that was determined (n) to be divisible by (i) then it was false and not a prime number. If there was no odd divisble numbers then the statement would return true. Afterwards I would test the function by inputting a console.log command in the terminal to print a string that determined whether or not the number in each variable was a prime number or not.
+
+
+### Similiarities and Differences
+
+
+1. **Syntax**: 
+   - to print messages in the console in javascript you would do console.log
+   - to print messages in the console in Java you would use the System.out.println command
+   - although they are different they ultimately perform the same action and the function's are built in a very similar order/pattern.
+
+2. ** Variables
+   - In javascript you can declare a variablle using let and achieve a more broader scope of defined objects whereas in Java you have to be more specific with the data type as an int,double,string,etc.
+
+3. ** Testing
+   - to run the java you would name the file with a .java at the end and type "java [filename.java]" to run the program
+   - to run the javascrip you would name the file with a .js at the end and type node [filename.js] to run the program