Today's Problems - Factorial and Fibonacci Series
Given a non-negative integer, find it's factorial using recursion
input: 4
output: 24
input: 5
output: 120
Given a number n, find the nth element in fibonacci series using recursion and after that print the series till n.
input = 7
output:
The 7th element in fibonacci series is: 13
The sequence is: 1, 1, 2, 3, 5, 8, 13
/**
* @author MadhavBahl
* @date 07/01/2018
*/
function factorial(num) {
if (num <= 1) return 1;
else return num * factorial(num - 1);
}
console.log(`Factorial of 4 is: ${factorial(4)}`);
console.log(`Factorial of 5 is: ${factorial(5)}`);/**
* @author MadhavBahl
* @date 07/01/2018
*/
import java.util.Scanner;
public class Factorial {
public static int factorial (int num) {
if (num <= 1)
return 1;
else
return num * factorial(num-1);
}
public static void main(String[] args) {
Scanner input = new Scanner (System.in);
System.out.println("/* ===== Factorial Using Recursion ===== */");
System.out.print("\nEnter a number: ");
int num = input.nextInt();
System.out.println("Factorial of " + num + " is: " + factorial(num));
}
}/**
* @author: Rajdeep Roy Chowdhury<[email protected]>
* @github: https://github.com/razdeep
* @date: 07/01/2019
*/
#include <bits/stdc++.h>
using namespace std;
long long factorial(long long n)
{
if (n <= 1)
return 1;
return n*factorial(n-1);
}
int main()
{
long long n;
cout<<"Enter a number ";
cin>>n;
cout<<"The factorial of "<<n<<" is "<<factorial(n)<<endl;
return 0;
}/**
* @author : sagunJaiswal
* @date 20/12/2020
*/
using System;
class day13 {
static int factorial(int n)
{
if (n == 0)
return 1;
return n * factorial(n - 1);
}
public static void Main()
{
String val;
Console.WriteLine("Input : ");
val = Console.ReadLine();
int num = Convert.ToInt32(val);
Console.WriteLine("Output:" + factorial(num));
}
}/**
* @author:divyakhetan
* @date: 10/1/2019
*/
#include<bits/stdc++.h>
using namespace std;
int fact(int n){
if(n == 1) return 1;
else return n * fact(n - 1);
}
int main(){
int n;
cin >> n;
cout << "The factorial is " << fact(n);
return 0;
}/*
* @author: ashwek
* @date: 7/1/2019
*/
#include <stdio.h>
long int fact(long int num){
if( num <= 1 ){
return 1;
}
return num * fact(num-1);
}
void main(){
int num;
printf("Enter a number = ");
scanf("%d", &num);
printf("Factorial of %d = %ld\n", num, fact(num));
}"""
@author : vishalshirke7
@date : 07/01/2019
"""
def factorial(no):
if no <= 1:
return 1
else:
return no * factorial(no - 1)
n = int(input())
print("factorial of %d is %d" % (n, factorial(n)))'''
@author spreeha
@date 07/01/19
'''
n=int(input())
def factorial(n):
if n==0:
return 1
else:
return n*factorial(n-1)
f=factorial(n)
print(f)"""
@author: aaditkamat
@date: 07/01/2019
"""
def fibonacci_recursive_value(num, array, ctr):
if num < 1:
return f'Incorrect num #{num} for fibonacci sequence'
if num == 1 or num == 2:
array[num - 1] = 1
return array[num - 1]
if array[num - 2] != 0 and array[num - 1] != 0:
return array[num - 2] + array[num - 3]
elif array[num - 2] != 0:
array[num - 3] = fibonacci_recursive_value(num - 2, array, ctr + 1)
elif array[num - 3] != 0:
array[num - 2] = fibonacci_recursive_value(num - 1, array, ctr + 1)
else:
array[num - 2] = fibonacci_recursive_value(num - 1, array, ctr + 1)
array[num - 3] = fibonacci_recursive_value(num - 2, array, ctr + 1)
return array[num - 2] + array[num - 3]
def fibonacci_recursive_sequence(num, arr):
if num < 1:
return fibonacci_recursive_value(num, arr, 0)
start = 1
string = 'The sequence is: '
while start <= num:
if start < num:
string += f'{fibonacci_recursive_value(start, arr[:], 0)}, '
else:
string += f'{fibonacci_recursive_value(start, arr[:], 0)}'
start += 1
print(string)
def fibonacci_iterative_sequence(num):
if num < 1:
return f'Incorrect num {num} for fibonacci sequence'
start = 1
string = 'The sequence is: '
while start <= num:
if start < num:
string += f'{fibonacci_iterative_value(start)}, '
else:
string += f'{fibonacci_iterative_value(start)}'
start += 1
print(string)
def fibonacci_iterative_value(num):
if num < 1:
return "Incorrect num #{num} for fibonacci sequence"
if num == 1 or num == 2:
return 1
first = 1
second = 1
ctr = 2
while ctr < num:
first += second
ctr += 1
if ctr == num:
return first
second += first
ctr += 1
return second
def main():
print("Enter an integer: ")
num = int(input())
a = [0] * num
print(f'The number at position {num} of fibonacci sequence: {fibonacci_recursive_value(num, a, 0)}')
fibonacci_recursive_sequence(num, a)
print(f'The number at position {num} of fibonacci sequence: {fibonacci_iterative_value(num)}')
fibonacci_iterative_sequence(num)
main()=begin
@author: aaditkamat
@date: 07/01/2019
=end
def factorial_recursive(num, result)
if num < 0
return "Factorial of #{num} is undefined"
end
if num === 0
return result
end
factorial_recursive(num - 1, result * num)
end
def factorial_iterative(num)
if num < 0
return "Factorial of #{num} is undefined"
end
result = 1
i = 1
until i > num do
result *= i
i += 1
end
result
end
def main
print "Enter an integer: "
num = gets.chomp!.to_i
puts "Factorial of #{num} is: #{factorial_recursive(num, 1)}"
puts "Factorial of #{num} is: #{factorial_iterative(num)}"
end
main/**
* @author MadhavBahl
* @date 07/01/2018
*/
function nthElement(n) {
if (n <= 2) return 1;
else return nthElement(n - 1) + nthElement(n - 2);
}
function fibonacci(num) {
// Print F(n)
console.log(
`The ${num}th element in fibonacci series is: ${nthElement(num)}`
);
// Print the sequence
let seq = "";
for (let i = 1; i <= num; i++)
if (i < num) seq += nthElement(i) + ", ";
else seq += nthElement(i);
console.log(`The sequence is: ${seq}`);
}
fibonacci(7);/**
* @author MadhavBahl
* @date 07/01/2018
*/
import java.util.Scanner;
public class Fibonacci {
public static int fibonacci (int num) {
if (num <= 2)
return 1;
else
return fibonacci (num-1) + fibonacci (num-2);
}
public static void main(String[] args) {
Scanner input = new Scanner (System.in);
System.out.println("/* ===== Fibonacci Using Recursion ===== */");
System.out.print("\nEnter a number: ");
int n = input.nextInt();
// Print the nth element in the sequence
System.out.println("\nThe " + n + "th element in fibonacci series is: " + fibonacci(n));
// Print the sequence
System.out.print("The sequence is: ");
for (int i=1; i<=n; i++) {
if (i<n)
System.out.print(fibonacci(i) + ", ");
else
System.out.print(fibonacci(i));
}
}
}/**
* @author: Rajdeep Roy Chowdhury<[email protected]>
* @github: https://github.com/razdeep
* @date: 07/01/2019
*/
#include <bits/stdc++.h>
using namespace std;
long long fibonacci(long long n)
{
if (n <= 2)
return 1;
return fibonacci(n-1)+fibonacci(n-2);
}
int main()
{
long long n;
cout<<"Enter a number ";
cin>>n;
string pos;
if(n%10 == 1)
pos="-st";
else if(n%10 == 2)
pos="-nd";
else
pos="-th";
cout<<"The "<<n<<pos<<" number of the fibonacci series is "<<fibonacci(n)<<endl;
return 0;
}/**
* @author:divyakhetan
* @date: 10/1/2019
*/
#include<bits/stdc++.h>
using namespace std;
int fibo(int n){
if(n <= 2) return 1;
else return fibo(n - 1) + fibo(n - 2);
}
int main(){
int n;
cin >> n;
cout << "The " << n << "th fibonacci number is " << fibo(n) << endl;
for(int i = 1; i <= n; i++){
if(i == n){
cout << fibo(i);
}
else{
cout << fibo(i) << " , ";
}
}
return 0;
}
### C Implementation
#### [Solution](./C/fibonacci.c)
```c
/*
* @author: ashwek
* @date: 7/1/2019
*/
#include <stdio.h>
int fib(int num) {
if( num <= 2 ){
return 1;
}
return fib(num-1) + fib(num-2);
}
void main(){
int num;
printf("Enter a number = ");
scanf("%d", &num);
printf("%dth element in fibonacci series is %d\n", num, fib(num));
}"""
@author : vishalshirke7
@date : 07/01/2019
"""
# Fibonacci Series using Dynamic Programming
def fibonacci(n):
if n <= 1:
return n
else:
if fib_series[n - 1] == 0:
fib_series[n - 1] = fibonacci(n - 1)
if fib_series[n - 2] == 0:
fib_series[n - 2] = fibonacci(n - 2)
fib_series[n] = fib_series[n - 2] + fib_series[n - 1]
return fib_series[n]
n = int(input())
fib_series = [0, 1]
while len(fib_series) < n + 1:
fib_series.append(0)
print(fibonacci(n))
if n == 0:
print(0)
else:
print(", ".join(map(str, fib_series)))'''
@author spreeha
@date 07/01/98
'''
n=int(input())
def fibonacci(n):
if n>=1 and n<=2:
return 1
else:
return fibonacci(n-1)+fibonacci(n-2)
for i in range(1,n):
t=fibonacci(i)
print(t,end=", ")
print(fibonacci(n))"""
@author: aaditkamat
@date: 07/01/2019
"""
def fibonacci_recursive_value(num, array, ctr):
if num < 1:
return f'Incorrect num #{num} for fibonacci sequence'
if num == 1 or num == 2:
array[num - 1] = 1
return array[num - 1]
if array[num - 2] != 0 and array[num - 1] != 0:
return array[num - 2] + array[num - 3]
elif array[num - 2] != 0:
array[num - 3] = fibonacci_recursive_value(num - 2, array, ctr + 1)
elif array[num - 3] != 0:
array[num - 2] = fibonacci_recursive_value(num - 1, array, ctr + 1)
else:
array[num - 2] = fibonacci_recursive_value(num - 1, array, ctr + 1)
array[num - 3] = fibonacci_recursive_value(num - 2, array, ctr + 1)
return array[num - 2] + array[num - 3]
def fibonacci_recursive_sequence(num, arr):
if num < 1:
return fibonacci_recursive_value(num, arr, 0)
start = 1
str = 'The sequence is: '
while start <= num:
if start < num:
str += f'{fibonacci_recursive_value(start, arr[:], 0)}, '
else:
str += f'{fibonacci_recursive_value(start, arr[:], 0)}'
start += 1
print(str)
def fibonacci_iterative_sequence(num):
if num < 1:
return f'Incorrect num {num} for fibonacci sequence'
start = 1
str = 'The sequence is: '
while start <= num:
if start < num:
str += f'{fibonacci_iterative_value(start)}, '
else:
str += f'{fibonacci_iterative_value(start)}'
start += 1
print(str)
def fibonacci_iterative_value(num):
if num < 1:
return "Incorrect num #{num} for fibonacci sequence"
if num == 1 or num == 2:
return 1
first = 1
second = 1
ctr = 2
while ctr < num:
first += second
ctr += 1
if ctr == num:
return first
second += first
ctr += 1
return second
def main():
print("Enter an integer: ")
num = int(input())
a = [0] * num
print(f'The number at position {num} of fibonacci sequence: {fibonacci_recursive_value(num, a, 0)}')
fibonacci_recursive_sequence(num, a)
print(f'The number at position {num} of fibonacci sequence: {fibonacci_iterative_value(num)}')
fibonacci_iterative_sequence(num)
main()=begin
@author: aaditkamat
@date: 07/01/2019
=end
def fibonacci_recursive_value(num, array, ctr)
if num < 1
return "Incorrect num #{num} for fibonacci sequence"
end
if num == 1 or num == 2
array[num - 1] = 1
return array[num - 1]
end
if array[num - 2] != 0 and array[num - 1] != 0
return array[num - 2] + array[num - 3]
elsif array[num - 2] != 0
array[num - 3] = fibonacci_recursive_value(num - 2, array, ctr + 1)
elsif array[num - 3] != 0
array[num - 2] = fibonacci_recursive_value(num - 1, array, ctr + 1)
else
array[num - 2] = fibonacci_recursive_value(num - 1, array, ctr + 1)
array[num - 3] = fibonacci_recursive_value(num - 2, array, ctr + 1)
end
value = array[num - 2] + array[num - 3]
value
end
def fibonacci_recursive_sequence(num, arr)
if num < 1
return fibonacci_recursive_value(num, arr, 0)
end
start = 1
print "The sequence is: "
until start > num do
if start < num
print"#{fibonacci_recursive_value(start, Array.new(arr), 0)}, "
else
puts "#{fibonacci_recursive_value(start, Array.new(arr), 0)}"
end
start += 1
end
end
def fibonacci_iterative_sequence(num)
if num < 1
return "Incorrect num #{num} for fibonacci sequence"
end
start = 1
print "The sequence is: "
until start > num do
if start < num
print"#{fibonacci_iterative_value(start)}, "
else
puts "#{fibonacci_iterative_value(start)}"
end
start += 1
end
end
def fibonacci_iterative_value(num)
if num < 1
return "Incorrect num #{num} for fibonacci sequence"
end
if num == 1 || num == 2
return 1
end
first = 1
second = 1
ctr = 2
until ctr >= num do
first += second
ctr += 1
if ctr == num
return first
end
second += first
ctr += 1
end
second
end
def main
print("Enter an integer: ")
num = gets.chomp!.to_i
a = []
a.fill(0, 0, num)
puts "The number at position #{num} of fibonacci sequence: #{fibonacci_recursive_value(num, a, 0)}"
fibonacci_recursive_sequence(num, a)
puts "The number at position #{num} of fibonacci sequence: #{fibonacci_iterative_value(num)}"
fibonacci_iterative_sequence(num)
end
main/**
* @author: sagunjaiswal
* @date: 20/09/2020
*/
using System;
namespace FibonacciSeries
{
class Program
{
public static int FibonacciSeries(int n)
{
if (n == 0)
return 1;
if (n == 1)
return 1;
return FibonacciSeries(n - 1) + FibonacciSeries(n - 2);
}
public static void Main(string[] args)
{
Console.Write("input : ");
int length = Convert.ToInt32(Console.ReadLine());
Console.Write("output : \n");
Console.Write("The {0}th term of fibonacci series is : {1} \n",length,FibonacciSeries(length-1));
Console.Write("The sequence is : ");
for (int i = 0; i < length; i++)
{
Console.Write("{0} ", FibonacciSeries(i));
}
Console.ReadKey();
}
}
}