completejavascript
diff --git a/‎function/function_check_prime_1.js
Lines changed: 12 additions & 0 deletions b/‎function/function_check_prime_1.js
Lines changed: 12 additions & 0 deletions
diff --git a/‎function/function_fibonaci_2.js
Lines changed: 19 additions & 0 deletions b/‎function/function_fibonaci_2.js
Lines changed: 19 additions & 0 deletions
diff --git a/‎program_structure_chess_board_3_1.js renamed to ‎program_structure/program_structure_chess_board_3_1.js b/‎program_structure_chess_board_3_1.js renamed to ‎program_structure/program_structure_chess_board_3_1.js
diff --git a/‎program_structure_chess_board_3_2.js renamed to ‎program_structure/program_structure_chess_board_3_2.js b/‎program_structure_chess_board_3_2.js renamed to ‎program_structure/program_structure_chess_board_3_2.js
diff --git a/‎program_structure_prime_4.js renamed to ‎program_structure/program_structure_prime_4.js b/‎program_structure_prime_4.js renamed to ‎program_structure/program_structure_prime_4.js
diff --git a/‎program_structure_prompt_2.js renamed to ‎program_structure/program_structure_prompt_2.js b/‎program_structure_prompt_2.js renamed to ‎program_structure/program_structure_prompt_2.js
diff --git a/‎program_structure_triangle_1.js renamed to ‎program_structure/program_structure_triangle_1.js b/‎program_structure_triangle_1.js renamed to ‎program_structure/program_structure_triangle_1.js
diff --git a/‎test.html
Lines changed: 16 additions & 19 deletions b/‎test.html
Lines changed: 16 additions & 19 deletions
@@ -0,0 +1,12 @@
+function isPrime(number){
+	if(isNaN(number)) return false;
+
+	if(number < 2) return false;
+	if(number == 2) return true;
+
+	for(i = 2; i * i <= number; i++){
+		if(number % i == 0) return false;
+	}
+
+	return true;
+}
@@ -0,0 +1,19 @@
+// recursion
+function f1(number){
+	if(number == 0 || number == 1) return 1;
+	return f1(number - 1) + f1(number - 2);
+}
+
+// loop
+function f2(number){
+	if(number == 0 || number == 1) return 1;
+
+	var a2 = 1, a1 = 1, a;
+	for(i = 2; i <= number; i++){
+ 		a = a1 + a2;
+ 		a2 = a1;
+ 		a1 = a;
+	}
+
+	return a;
+}
@@ -2,30 +2,27 @@
 <html>
 <head>
   <script>
-    // JavaScript code here...
-    while (true) {
-	var number = Number(prompt('Enter a positive number:'));
-		if (!isNaN(number) && number > 0) break;
+    function f1(number){
+		if(number == 0 || number == 1) return 1;
+		return f1(number - 1) + f1(number - 2);
 	}
 
-	if (number < 2) {
-		alert("It's not a prime number.");
-	}
-	else if(number == 2) {
-		alert("It's a prime number.");
-	}
-	else {
-		var check = true;
-		for(var i = 2; i < number; i++) {
-			if (number % i == 0) {
-				check = false;
-				break;
-			}
+	function f2(number){
+		if(number == 0 || number == 1) return 1;
+
+		var a2 = 1, a1 = 1, a;
+		for(i = 2; i <= number; i++){
+	 		a = a1 + a2;
+	 		a2 = a1;
+	 		a1 = a;
 		}
-		if(check) alert("It's a prime number.");
-		else alert("It's not a prime number.");
+
+		return a;
 	}
 
+	console.log(f1(6));
+	console.log(f2(6));
+
   </script>
 </head>
 <body></body>