Created
January 26, 2014 10:37
-
-
Save LESTADru/8631016 to your computer and use it in GitHub Desktop.
вычисление нужного числа фибоначи с помощью рекурсии и цикла.
This file contains 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> | |
<title>Функция возвращающая нужное порядковое число фибоначи</title> | |
</head> | |
<body> | |
<script> | |
// с помощью рекурсии. Медленно. | |
function fib(n){ | |
return (n<=1) ? n: fib(n-1)+fib(n-2); | |
} | |
alert(fib(7)); | |
// с помощью цикла/ | |
function fibCicle(n){ | |
var fib1=1; | |
var fib2=1; | |
var fibn=0; | |
if(n==1 || n==2){ | |
return fib1; | |
}else{ | |
for(var i=3;i<=n;i++){ | |
fibn= fib1 + fib2; | |
fib2=fib1; | |
fib1=fibn; | |
console.log('fib1='+ fib1); | |
console.log('fib2='+ fib2); | |
console.log('fibn='+ fibn); | |
} | |
} | |
return fibn; | |
} | |
alert(fibCicle(7)); | |
</script> | |
</body> | |
</html> |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment