Tags
 IOS SQL HTML C RUBY-ON-RAILS MYSQL ASP.NET DEVELOPMENT RUBY .NET LINUX SQL-SERVER REGEX WINDOWS ALGORITHM ECLIPSE VISUAL-STUDIO STRING SVN PERFORMANCE APACHE-FLEX UNIT-TESTING SECURITY LINQ UNIX MATH EMAIL OOP LANGUAGE-AGNOSTIC VB6

# Fibonacci numbers program

By : Andrzej Karczyński
Date : August 22 2020, 09:00 AM
To fix the issue you can do Try printing a instead of b. a and b are the first two terms of the sequence, so if you want to print the first term you have to print a.
To get your desired output, instead of the usual fibbonacci sequence, you'll also need to increase b by one, every iteration:
code :
``````a, b = b, (a + b + 1)
``````

Share :

## Threaded Program to compute Fibonacci numbers

By : user2783207
Date : March 29 2020, 07:55 AM
I think the issue was by ths following , You're passing the address of a double to CreateThread, then you try to treat it as an int * in the thread func. Change double x; to int x;

By : Chaitanya JV
Date : March 29 2020, 07:55 AM
will help you I am obliged to write program that will show minimal quantity of Fibonacci numbers which sum is equal to k number which user write into program.
code :
``````#include <iostream>
#include <vector>
#include <stdlib.h>
using namespace std;

void prepare( vector<int> & fibos ) {  ... }  // along the lines we see in OPs code

int findClosest( int n, vector<int> & fibos ){ // return Fibonacci number closest to n
int fi = 0;
for( std::vector<int>::iterator it = fibos.begin() ; it != fibos.end(); ++it){
if( abs(*it - n) < abs(fi - n) ){
fi = *it;
}
}
return fi;
}

// The algorithm:
// lookup closest Fi, add "signed" to terms
// reduce n, adjust sign and call recursively
void sum( int n, vector<int> & fibos, vector<int> & terms, int sign = 1 ){
if( n == 0 ) return;
int fi = findClosest( n, fibos );
terms.push_back( sign*fi );
sum( abs(n - fi), fibos, terms, n - fi > 0 ? sign : -sign );
}

int main() {
vector<int> fibos;
prepare( fibos );
vector<int> terms;
int n = 1070;
sum( n, fibos, terms );
cout << n << " =";
for( std::vector<int>::iterator it = terms.begin() ; it != terms.end(); ++it){
cout << " " << *it;
}
cout << endl;
return 0;
}
``````

## Fibonacci Series in C Program where FIRST 2 numbers are given by user

By : Led Zep
Date : March 29 2020, 07:55 AM
may help you . Since this is for study, issues with your code: you don't need to duplicate the calls to scanf(), simply initialize one of the variables to fail (which you did: lenght = 0) and let the loop do its thing; pick one indentation style and stick with it; if you're new to C, always include the curly braces, even when the language says they're optional; you (correctly) allow for a length of 2, but then print three numbers; your if (i <= 1) clause is a no-op as the loop starts with for (i = 3; so i is never less than 3.
Putting it all together, we get something like:
code :
``````#include <stdio.h>

int main() {
int length = 0, a, b;

while (length < 2 || length > 100 || a > b ) {
printf("\nFirst number: ");
(void) scanf("%d", &a);
printf("\nSecond number: ");
(void) scanf("%d", &b);
printf("\nHow long?: ");
(void) scanf("%d", &length);
}

printf("%d\t%d\t", a, b);

for (int i = 2; i < length; i++) {
int fib = a + b;

printf("%d\t", fib);

a = b;
b = fib;
}

printf("\n");

return 0;
}
``````

## A program in C to get previous two fibonacci numbers less than the given number

Date : March 29 2020, 07:55 AM
wish help you to fix your issue , Initialize i=-1, and inside the do while loop increment i first
code :
``````int i=-1;

do
{
i++;
p[i] = fibo(i);

} while(p[i] <=n);

printf("%d %d", p[i-1], p[i-2]);// print i-1 and i-2
``````

## Program that uses while loops to calculate the first n Fibonacci numbers

By : Ci Williams
Date : March 29 2020, 07:55 AM
I wish this help you There are several problems with the code:
You never assign anything to fibnum inside the body of the loop, so its value never changes. The purpose of current++ is entirely unclear.