forked from Asiatik/codezilla
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Fibonacci Series in python (Asiatik#346)
* Fibonacci Series in python * fibonacci series in python * fibonacci series in python
- Loading branch information
1 parent
1e1d47e
commit 2ce9bde
Showing
3 changed files
with
84 additions
and
0 deletions.
There are no files selected for viewing
28 changes: 28 additions & 0 deletions
28
Dynamic Programming/Fibonacci Sequence/Fibonacci_series.txt
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
# Program to display the Fibonacci sequence up to n-th term where n is provided by the user | ||
|
||
# change this value for a different result | ||
nterms = int (input("enter the no. of terms " )) | ||
|
||
# uncomment to take input from the user | ||
#nterms = int(input("How many terms? ")) | ||
|
||
# first two terms | ||
n1 = 0 | ||
n2 = 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 upto",nterms,":") | ||
while count < nterms: | ||
print(n1,end=' , ') | ||
nth = n1 + n2 | ||
# update values | ||
n1 = n2 | ||
n2 = nth | ||
count += 1 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
# Program to display the Fibonacci sequence up to n-th term where n is provided by the user | ||
|
||
# change this value for a different result | ||
nterms = int (input("enter the no. of terms " )) | ||
|
||
# uncomment to take input from the user | ||
#nterms = int(input("How many terms? ")) | ||
|
||
# first two terms | ||
n1 = 0 | ||
n2 = 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 upto",nterms,":") | ||
while count < nterms: | ||
print(n1,end=' , ') | ||
nth = n1 + n2 | ||
# update values | ||
n1 = n2 | ||
n2 = nth | ||
count += 1 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
# Program to display the Fibonacci sequence up to n-th term where n is provided by the user | ||
|
||
# change this value for a different result | ||
nterms = int (input("enter the no. of terms " )) | ||
|
||
# uncomment to take input from the user | ||
#nterms = int(input("How many terms? ")) | ||
|
||
# first two terms | ||
n1 = 0 | ||
n2 = 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 upto",nterms,":") | ||
while count < nterms: | ||
print(n1,end=' , ') | ||
nth = n1 + n2 | ||
# update values | ||
n1 = n2 | ||
n2 = nth | ||
count += 1 |