fibonacci

问题 How exactly is the Java stack set up? For university, I shall determine what the biggest possible Fibonacci number that is calculated by a recursive method and can be handled by the stack. The interesting thing is: Tests showed that it doesn't matter how much -Xmx and -Xms the JVM has. I am able to run up to Fib(4438). But the results aren't consistent. Somtimes it goes down to 4436. Is there formular for the stack? Any increase of the stack via -Xss 4096m doesn't make a difference. 回答1: -Xmx

问题 Trying to get my fibonacci sequence to work using recursion but am running into the error maximum callstack exceeded . Code: var genFib = function(count, limit, fibArray) { if (count === undefined || count === null) { var count = 0; } if (fibArray === undefined || fibArray === null) { var fibArray = [0, 1]; } if (count === limit) { console.log(fibArray); return fibArray; } var pushFibNo = function(fibArray) { fibArray.push(fibArray[fibArray.length - 1] + fibArray[fibArray.length - 2]); return

问题 This question already has answers here : Closed 8 years ago . Possible Duplicate: Fibonacci numbers, with an one-liner in Python 3? It may be very easy thing, but I am very new to Python. I came up with this single statement Fibonacci. [fibs.append(fibs[-2]+fibs[-1]) for i in xrange(1000)] Not really single statement, though. I need to initialise the list, fibs , before firing this statement i.e. fibs = [0, 1] . Now, I have 2 questions, How can we get rid of this list initialisation statement

问题 Somebody please explain me the fibonacci search algorithm. I have tried numerous resources around and searched a lot, but the algorithm is still unclear. Most of the resources described it in link with binary search, but I didn't understand 'em. I know fibonacci search algorithm is an extension of binary search, which I know quite well. My books failed to explain as well. I know about fibonacci numbers defined as F(n) = F(n-1) + F(n-2), so no need to explain that. Updating the question by

问题 public static int getFib(int num) { if (num < 2) { return num; } return getFib(num - 1) + getFib(num - 2); } How can I use this code to print out this sample output like file attached with the same format of print out 回答1: Assuming your getFib() is like this: public static int getFib(int num) { if (num < 2) { return num; } int tmp = getFib(num - 1) + getFib(num - 2); return tmp; } In the main() function call the getFib() function for the asked number of times and print the values returned, as

问题 long int F(int n){ long int F[n]; if (n<2) return n; else { F[0]=0; F[1]=1; for (int i=2; i<n+1; i++) F[i]=F[i-1]+F[i-2]; return F[n]; } } Hi guys, can anyone know how to compute the time complexity of the function above? I am studying C++ and I am quite suffering about compute time complexity of a random algorithm. Please help me! Thanks in advance. 回答1: The code shown relies on a g++ language extension, variable length arrays. I.e. it's not standard C++. The code also misdirects a little by

问题 I am working through this Free Code Camp exercise. Return the sum of all odd Fibonacci numbers up to and including the passed number if it is a Fibonacci number. The first few numbers of the Fibonacci sequence are 1, 1, 2, 3, 5 and 8, and each subsequent number is the sum of the previous two numbers. And here is what I have so far... Any suggestions? function sumFibs(num) { var arr, isFibVal, isEvenVal, sum, i = 0, fibonacci = function (num){ var a, b, result, fibArr = [1]; a=0; b=1; result=b

问题 // I am learning about recursion in Java. /** I am trying to calculate the 45th Fibonacci number by using an array to shorten the time used, which does not work out well... error message: Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 45 at Auf1.fib2(Auf1.java:25) at Auf1.main(Auf1.java:49) **/ public class Auf1 { public static long[] feld; public static long fib2(long n) { if ((n == 1) || (n == 2)) { return 1; } else { if (feld[(int) n] != -1) { return feld[(int) n]; }

问题 So I have an exercise of finding a Fibonacci sequence but with different starting number and I can't figure out why my code works most of the time, but not in some cases. My code is based on a formula (link: https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/) If n is even then k = n/2: F(n) = [2*F(k-1) + F(k)]*F(k) If n is odd then k = (n + 1)/2 F(n) = F(k)*F(k) + F(k-1)*F(k-1) - #include <map> #include <iostream> #include <cmath> using namespace std; #define long long long map

问题 Today I wrote a recursive fibonacci in assembly and it doesn't work. I compiled it to object file with NASM and than made it elf with gcc. When I enter 1 or 2 the function works perfectly, but when I enter 3, 4, 5, 6, or more the function doesn't work. I think there is problem where the function calls itself. This the code: SECTION .data ;init data str: db "This equal: %d",10,0 SECTION .text ;asm code extern printf global main main: push ebp mov ebp,esp ;-------------------- push 03 ; the