function res(num){

    return 'f('+num+')='num

}

<s cript type="text/javas cript">

var super_arr = function(index){

var arr = [1,1];

var start = true;

var front = 0 ;

var behind = 1 ;

var num ;

while(start){

if(behind < index){

num = arr[front] + arr[behind];

arr.push(num);

front ++ ;

behind ++ ;

}else{

break;

}

}

console.log(arr)

return arr[index];

} 

var result = super_arr(10);

console.log(result)

</s cript>

请多指正！

function fibonacci(n){
    		return n<2 ? n : fibonacci(n-1) + fibonacci(n-2);
    	}

0

斐波那契数列函数

还不会额

.