Homework Day 3

isPrime.js

@@ -0,0 +1,11 @@
+var isPrime = function(num) {
+ 	var isPrime = true;
+    for (var i = 2; i <= Math.sqrt(num); i++) {
+      if (num % i == 0) {
+          var isPrime = false
+          }
+    }
+    return isPrime;
+}
+
+console.log(isPrime(33));

numSquare.js

@@ -0,0 +1,9 @@
+var numSquare = function(maxNum) {
+    var myArray = [];
+    for (i = 0; (i*i) < maxNum; i+=1) {
+        myArray.push(i*i);
+    }
+    return myArray;
+}
+
+console.log(numSquare(100));

primeS.js

@@ -0,0 +1,24 @@
+var isPrime = function(num) {
+ 	var isPrime = true;
+    for (var i = 2; i <= Math.sqrt(num); i++) {
+      if (num % i == 0) {
+          var isPrime = false
+          }
+    }
+    return isPrime;
+}
+
+
+
+var primeS = function(maxPrime) {
+	var primeArray = [];
+	for (i = 0; i < maxPrime; i+=1) {
+		if (isPrime(i) === true) {
+			primeArray.push(i);
+		}	
+	}
+	return primeArray;
+
+}
+
+console.log(primeS(100));

problemOfTheDay.js

@@ -0,0 +1,9 @@
+var swap = function(arr, i, j) {
+	var first = myArr[i];
+	var second = myArr[j];
+	myArr[j] = first;
+	myArr[i] = second;
+	return myArr;
+}
+
+console.log(swap(arr, 0, 2));

sillySum.js

@@ -0,0 +1,10 @@
+var myArray = [1, 6, 13];
+var sillySum = function(myArray) {
+    var count = 0;
+    for (i = 0; i < myArray.length; i += 1) {
+       count += (i * myArray[i]);
+    }
+    return count;
+};
+
+console.log(sillySum(myArray));