Merge branch 'code-differently:main' into main

Author: AmiyahJo

lesson_04/AngelicaC/README.md

@@ -0,0 +1,68 @@
+```python 
+# takes input from console and sets it to integer
+number = int(input(Enter the number: "))
+#when no number input=false
+flag = false
+##check to see if numbers divide by 2,if true it breaks function.
+for i in range (2, number):
+    if (number % i ==0):
+        flag = true
+        break
+##entered number is not prime and will return it
+if flag:
+    print("Entered number {} is not a prime number".format(number))
+    ##entered number is a prime number
+else:
+    print("Entered number {} is a prime number".format(number))       
+```
+number = int(input("Enter a whole number: "))
+
+
+```javascript
+// the function will be calling an n that it will output.
+function isprime(n) {
+  // if the output n is 1, it will be false 
+    if (n <=1)
+        return false;
+// i will be a number that will loop from 2 to the square root of n. 
+    for (let i = 2; i < n;i++) {
+        if(n % i ===0) {
+            return false;
+        }
+    }
+    return true;
+
+}
+
+console.log(isprime(5))
+
+## Explanation
+
+/*Python function uses the i as variable if. If the variable gets divided by 2 and it results in 0, then it is true and the code will not run/break.
+*/
+
+/* In javaScript the function will be calling an n that it will output. if the output n is 1, it will be false. i will be a number that will loop from 2 to the square root of n. 
+*/
+
+/*Differences
+when using python, the language will use `if` keyword, to deteremine if the number will be an interger. Whereas, in Javascript, the language being used will be called a `function`. 
+*/
+
+/*Type coercion
+Python is particular when it comes to the input the variable and can have different outputs. 
+Javascript is easier to write but if it not input correctly,it can affect the code.
+*/
+
+/*Function calls
+Syntax to call the fucntion for python is 
+number = int().
+Syntax for Javascript is console.log().
+*/
+
+/*Citations
+Python
+https://www.youtube.com/watch?v=J-5swSZj_iI
+
+Javascript
+https://www.youtube.com/watch?v=cmco9fi3xnA
+*/

lesson_04/AngelicaC/python.py

@@ -0,0 +1,16 @@
+number = int(input("Enter the number:"))
+#
+flag = False
+
+if (number <= 1):
+    flag = False
+
+for i in range (2, number):
+    if (number % i ==0):
+        flag = True
+        break
+
+if flag:
+    print("Entered number {} is not a prime number".format(number))
+else:
+    print("Entered number {} is a prime number".format(number))

lesson_04/AngelicaC/script.js

@@ -0,0 +1,15 @@
+function isprime(n) {
+  // if the output n is 2, it will be false 
+    if (n <2)
+        return false;
+// i will be a number that will loop from 2 to the square root of n. 
+    for (let i = 2; i <= Math.sqrt(n);i++) {
+        if(n % i ===0) {
+            return false;
+        }
+    }
+    return true;
+
+}
+
+console.log(isprime(5))

lesson_04/cdbluejr/Prime.bas

@@ -0,0 +1,18 @@
+100 rem find prime number
+110 n =1
+120 c=0
+130 i=1
+140 if i<=n or (n mod i)<>0 then 300  
+145 if i=n and c=2 then 200
+150 c=c+1
+160 if i>n then 210
+170 goto 130
+
+200 Print n + “Prime"
+210 c=0
+220 n=n+1
+230 if c>n then 120
+240 goto 130
+
+300 i=i+1
+310 goto 140

lesson_04/cdbluejr/Prime.java

@@ -0,0 +1,19 @@
+public class Prime {
+        public static void main(String[] args) {
+ 
+
+        int num = 29;
+        int count = 0;
+        for(int i=1; i<=num; i++) {
+            if(num % i ==0) {
+                count++;
+            }
+        }
+        if(count==2) {
+            System.out.println("Prime");
+        } else {
+            System.out.println("not Prime");    
+        }
+    }
+}
+

lesson_04/cdbluejr/README.md

@@ -0,0 +1,51 @@
+## Java implementation
+
+        int num = 29;
+        int count = 0;
+        for(int i=1; i<=num; i++) {
+            if(num % i ==0) {
+                count++;
+            }
+        }
+        if(count==2) {
+            System.out.println("Prime");
+        } else {
+            System.out.println("not Prime");   
+
+
+## Basic implementation
+
+100 rem find prime number
+110 n =1
+120 c=0
+130 i=1
+140 if i<=n or (n mod i)<>0 then 300  
+145 if i=n and c=2 then 200
+150 c=c+1
+160 if i>n then 210
+170 goto 130
+
+200 Print n + “Prime"
+210 c=0
+220 n=n+1
+230 if c>n then 120
+240 goto 130
+
+300 i=i+1
+310 goto 140
+
+## Explanation
+
+The java implementation uses the counting system to only count to 2, to signify a prime number.
+
+The basic implementation also uses the counting system to only count to 2, to signify a prime number.
+
+### Differences
+
+1. **Syntax**: 
+   - In Java, it uses the fuctions Modelo function to determine if the reminder is zero to determine if the number is divisable evenly.
+   - Basic uses the if then else function to determine if the number is prime or not.
+
+3. **Function Calls**:
+   - The ability to print for both programs are different, java uses System.out.println, while BASIC just uses the word print.
+