Print Fibonacci Sequence Python

PROGRAM TO PRINT FIBONACCI SEQUENCE 


nterms = int(input("How many terms? "))

# first two terms
n1, n2 = 0, 1
count = 0

# check if the number of terms is valid
if nterms <= 0:
   print("Please enter a positive integer")
elif nterms == 1:
   print("Fibonacci sequence upto",nterms,":")
   print(n1)
else:
   print("Fibonacci sequence:")
   while count < nterms:
       print(n1)
       nth = n1 + n2
       # update values
       n1 = n2
       n2 = nth
       count += 1

OUTPUT
How many terms? 7
Fibonacci sequence:
0
1
1
2
3
5
8

Comments

Post a Comment

Popular posts from this blog

Facing the sun Java

PROGRAM TO FIND THE NUMBER OF BUILDINGS FACING THE SUN class Test {      // Returns count buildings that can see sunlight      static int countBuildings( int arr[], int n)      {          // Initialuze result  (Note that first building          // always sees sunlight)          int count = 1 ;                   // Start traversing element          int curr_max = arr[ 0 ];          for ( int i= 1 ; i<n; i++)          {              // If curr_element is maximum,              // update maximum and increment count              if (arr[i] > curr_max)              {                  count++;                  curr_max=arr[i];              }          }                   return count;      }              // Driver method      public static void main(String[] args)       {          int arr[] = { 7 , 4 , 8 , 2 , 9 };                      System.out.println(countBuildings(arr, arr.length));                  } } OUTPUT 3 CREDITS:  https://www.geeksforgeeks.org/number-buildings
Read more

Add two numbers represented by linked lists Java

PROGRAM TO ADD TWO NUMBERS REPRESENTED BY LINKED LISTS class LinkedList {        static Node head1, head2;        static class Node {            int data;          Node next;            Node( int d)          {              data = d;              next = null ;          }      }        /* Adds contents of two linked lists and return the head node of resultant list */      Node addTwoLists(Node first, Node second)      {          // res is head node of the resultant list          Node res = null ;          Node prev = null ;          Node temp = null ;          int carry = 0 , sum;            // while both lists exist          while (first != null || second != null ) {              // Calculate value of next              // digit in resultant list.              // The next digit is sum              // of following things              // (i)  Carry              // (ii) Next digit of first              // list (if there is a next digit)              // (ii) Next digit of second    
Read more