One line function for factorial of a number
Factorial of a non-negative integer, is multiplication of all integers smaller than or equal to n.
Example :
Factorial of 6 is 6 * 5 * 4 * 3 * 2 * 1 which is 720.
We can find the factorial of a number in one line with the help of Ternary operator or commonly known as Conditional operator in recursion.
C++
#include<iostream>
int factorial( int n)
{
return (n==1 || n==0) ? 1: n * factorial(n - 1);
}
int main()
{
int num = 5;
printf ( "Factorial of %d is %d" , num, factorial(num));
return 0;
}
|
Java
import java.io.*;
class GFG {
static int factorial( int n)
{
return (n == 1 || n == 0 ) ? 1 : n *
factorial(n - 1 );
}
public static void main(String[] args)
{
int num = 5 ;
System.out.println( "Factorial of " + num +
" is " + factorial(num));
}
}
|
Python3
def factorial(n):
return 1 if (n = = 1 or n = = 0 ) else n * factorial(n - 1 );
num = 5 ;
print ( "Factorial of" , num,
"is" , factorial(num));
|
C#
using System;
class GFG
{
static int factorial( int n)
{
return (n == 1 || n == 0) ?
1 : n * factorial(n - 1);
}
public static void Main()
{
int num = 5;
Console.WriteLine( "Factorial of " + num +
" is " + factorial(num));
}
}
|
PHP
<?php
function factorial( $n )
{
return ( $n ==1 || $n ==0) ? 1 :
$n * factorial( $n - 1);
}
$num = 5;
echo "Factorial of " , $num ,
" is " , factorial( $num );
?>
|
Javascript
<script>
function factorial(n)
{
return (n == 1 || n == 0) ? 1 :
n * factorial(n - 1);
}
let num = 5;
document.write( "Factorial of " , num,
" is " , factorial(num));
</script>
|
Output :
Factorial of 5 is 120
Time complexity: O(n) where n is given number
Auxiliary Space: O(n)
Last Updated :
17 Feb, 2023
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...