Skip to main content

S.Y.I.T Sem 3 Python Practical | Python| Python practical 1f|Write a recursive function to print the factorial for a given number. | python for beginner

 Hello reader's 

In this blog post we are going to see that how we can print the factorial for a given number using python.




To do this, first you have to know the basics like - What is recursive function? , What is factorial?, How to find the factorial of any given number. 

Now let's see it one by one, First of all we will understand that What is recursive Function?

Recursive function is a function that call itself after a fix interval of time. Using the recursive algorithm, certain problems can be solved quite easily. Towers of Hanoi (TOH) is one such programming exercise. Try to write an iterative algorithm for TOH. Moreover, every recursive program can be written using iterative methods.

Mathematically, recursion helps to solve a few puzzles easily.

For example, a routine interview question,

In a party of N people, each person will shake her/his hand with each other person only once. In total how many hand-shakes would happen? 

It can be solved in different ways; graphs, recursions, etc. Let us see how recursively it can be solved.

There are N persons. Each person shakes hands with each other only once. Considering N-th person, (s)he has to shake a hand with (N-1) the person. Now the problem is reduced to small instances of (N-1) persons. Assuming TN as a total shake-hands, it can be formulated recursively.

TN = (N-1) + TN-1 [T1 = 0, i.e. the last person has already shook-hand with every one]

Solving it recursively yields an arithmetic series, which can be evaluated into N(N-1)/2.

now we will see What is factorial?

The factorial of a number is the function that multiplies the number by every natural number below it. 

For example, 4 factorial, that is, 4! can be written as: 4! = 4×3×2×1 = 24.

How to find the factorial of any given number ?

The formula for n factorial is: 

                n!=n*(n-1)!

This means that the factorial of any number is, the given number, multiplied by the factorial of the previous number. So, 

8!= 8*7*6*5*4*3*2*1

9!= 9*8*7*6*5*4*3*2*1

and so on ......






Code - 

def recur_factorial(n):

    """function to return the factorial of a number using recursion"""

    if n == 1:

        return n

    else:

        return n*recur_factorial(n-1)


num = int(input("Enter a number: "))


if num<0:

    print ("Sorry , factorial does not exists for a negative number")

elif num ==0:

    print("The factorial of 0 is 1")

else:

    print("The factorial of",num,"is",recur_factorial(num))

Comments

Popular posts from this blog

Android 13 features| Android 13 updates| Material You design| language Customizable| Android themes Privacy and security controls in Android 13| App Hibernation in Android 13| Adaptive Charging in Android 13| Android 13 release date| Android Beta Program| Latest Android version

 Android 13: What's New and Exciting? Android 13, codenamed Tiramisu, is the latest version of Google's mobile operating system that is expected to launch in late 2023. Android 13 promises to bring a host of new features and improvements to enhance the user experience, security, and performance of Android devices. In this blog post, we will take a look at some of the most anticipated features of Android 13 and how they will benefit users and developers alike. One of the biggest changes in Android 13 is the introduction of Material You, a new design language that adapts to the user's preferences, mood, and context. Material You allows users to customize their device's theme, colors, fonts, icons, and shapes according to their personal style and taste. Material You also changes dynamically based on the time of day, the wallpaper, the app, and the device mode. For example, if the user switches to dark mode, the system will automatically adjust the colors and brightness to ...

Define a procedure histogram() that takes a list of integers and prints a histogram to the screen| Histogram procedure| printing histogram| Python histogram function| Python programming

  How to Visualize Data with Python: Defining a Procedure Histogram() When it comes to analyzing data, visualization is key. Being able to see the patterns and trends in your data can make all the difference in understanding it. Luckily, Python has a built-in function for creating histograms, which is a powerful tool for visualizing data. In this blog post, we'll define a procedure called histogram() that takes a list of integers and prints a histogram to the screen. Before we get into the nitty-gritty of the code, let's briefly discuss what a histogram is and why it's useful. A histogram is a graphical representation of a frequency distribution, which is essentially a way to show how often certain values occur in a dataset. It's a great way to get a quick sense of the shape of your data, including its range, distribution, and outliers. Now, let's dive into the code. Here's how you can define a procedure histogram() in Python: def histogram(int_list):     for i ...

DALL-E AI, AI-generated images, GPT-3, OpenAI, artificial intelligence, natural language processing, deep learning, neural networks, image synthesis, image recognition, visual content creation.

 DALL.E is an AI system that can create images from text descriptions, using a large neural network trained on a dataset of text-image pairs. It was introduced by OpenAI in January 2021, and has since been improved with DALL.E 2, which generates more realistic and accurate images with higher resolution. In this blog post, I will explain how DALL.E works and show some examples of its amazing capabilities. DALL.E is based on GPT-3, a transformer language model that can generate text for a wide range of tasks. DALL.E extends GPT-3 by adding image tokens to its vocabulary, allowing it to generate both text and images in a single stream of data. DALL.E receives both the text and the image as input, and is trained to generate all of the tokens, one after another, using maximum likelihood. To represent images, DALL.E uses a discrete variational autoencoder (VAE) that compresses each image to a 32x32 grid of discrete latent codes. Each code corresponds to one of 8192 possible image tokens....