Fibonnaic Sequence

 

*.Fibonnaic sequence :- The Fibonnaic Sequence is a series of numbers in which each number is the sum of two preceding numbers.


#.Code :- 


#include<iostream>
using namespace std;
void adtn_fun(int x,int y,int z){
    for(int i=0;i<z;i++){
        int sum=x+y;
        cout<<(i+1)<<". : "<<x<<" + "<<y<< " = "<<sum<<endl;
        int temp=x;
        x=y;
        y=sum;
        sum=temp;
    }
}
int main(){
    int n1,n2;
    cout<<"enter 1st num : ";
    cin>>n1;
    cout<<"enter 2nd num : ";
    cin>>n2;
    int loop;
    cout<<"enter how many times you want to perform function : ";
    cin>>loop;
    adtn_fun(n1,n2,loop);
    return 0 ;
}



#.Output :- 




Comments

Post a Comment

Popular posts from this blog

To do addition of all the Elements of Array in C++

Image
C++ code to do addition of all elements in array :- #include<iostream> using namespace std; int main(){          int n ;     cout<<"enter size if array : ";     cin>>n;     int arr[n];     cout<<"Enter "<<n<<" Array : ";     for(int i=0;i<n;i++){         cin>>arr[i];     }     cout<<"The array you entered is :";     for(int i=0;i<n;i++){         cout<<arr[i]<<" ";     }     cout<<endl;     int sum=0;     for(int i=0;i<n;i++){     sum+=arr[i];     }     cout<<"the addition of all elements in the array is :" <<sum;          return 0;      } Output :- Video of Output :- 
Read more

A program to Search element in array , and if repeated so at which location it is present and how many time the number is repeated

Image
  CODE :-  //FIXED-FINAL UPDATE FULLY WORKING CODE #include <iostream> using namespace std ; int i ; // I've created available() and notavailable() function and call it in the function named searching (); void available ( int n , int key , int arr []){       for ( int i = 0 , j = 1 ; i < n , j < n + 1 ; i ++ , j ++ ){           if ( arr [ i ] == key ){               cout << "the element present at : " << j << " location" << endl ;          }      } } void notavailable ( int n , int key , int []){     int arr [ n ];     for ( int i = 0 ; i < n ; i ++ ){         if ( arr [ i ] != key ){               cout << "the element is not present " ;               break ;           } ...
Read more

Take n no. Of elements and arrange them in Ascending & Descending Order

Image
Que. Take n no. Of elements and arrange them in Ascending & Descending Order    Code:- #include<iostream> //or #include<bits/stdc++.h> //^ this one is awesome for doing all kind of stuff in c++ and also you dont have to include any other header file ,if you enter this one  using namespace std; int main (){     int n ;     cout<<"write size of array:";     cin>>n;     int arr[n];     for(int i =0, j=1;i<n,j<n+1;i++,j++){         cout<<"enter "<<j<<"th location value: ";         cin>>arr[i];         cout<<" ";     }              //program for arranging in ascending order using for loop      for(int j=0;j<n;j++){         for(int i=0;i<n;i++){             if(arr[i]>arr[i+1]){   ...
Read more