Last active
August 29, 2015 13:58
-
-
Save jayhjkwon/9929291 to your computer and use it in GitHub Desktop.
Fibonacci in JavaScript
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<meta charset="utf-8"> | |
<title>JS Bin</title> | |
</head> | |
<body> | |
</body> | |
</html> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// 피보나치 | |
console.log('--------------------'); | |
// #1, 단순 루프와 변수만을 이용한 방법 | |
function iterFib(n) { | |
var last = 1; | |
var nextLast = 1; | |
var result = 1; | |
for (var i = 2; i < n; i++) { | |
result = last + nextLast; | |
nextLast = last; | |
last = result; | |
} | |
return result; | |
} | |
console.log(iterFib(50)); | |
// #2, 배열을 이용한 방법 | |
function fibo(n) { | |
var result = 1; | |
var prev_one, prev_two; | |
var arr = []; | |
for(var i=0; i<n; i++) { | |
if (i === 0) { | |
arr[0] = 1; | |
}else if (i === 1) { | |
arr[1] = 1; | |
}else { | |
arr[i] = arr[i-2] + arr[i-1]; | |
} | |
} | |
return arr[n-1]; | |
} | |
console.log(fibo(50)); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
function fibo(n) {
var arr = [];
for(var i=0; i<n; i++) {
if (i === 0) {
arr[0] = 1;
}else if (i === 1) {
arr[1] = 1;
}else {
arr[i] = arr[i-2] + arr[i-1];
}
}
return arr[n-1];
}