Functions and Recursion in PYTHON

A Function is a group of statements performing a particular task.

When a program gets bigger in size and its complexity increases, it gets difficult for a programmer to keep track on which piece of code is doing what ! A function can be reused by the programmer in a given program any number of times as he wants.

Syntax of a Function in Python :-

def func():

print("Hello")

#this function can be called any number of times.

Function cell :-

Whenever we want to call a function we put the name of the function as 'def func_name():'

Function definition is the exact set of instruction which are to be excuted.

Lets write an easy code :-

It was an easy program, lets see some other examples :-

Now we will make a programme of summation using function :-

Now we will see a complicated problem, So that you can understand better :-

Now we have to write a program to find the maximum of three numbers using function :-

Now I hope you understand Functions.

Recursion :-

Recursion is a function which calls itself. It is used to directly use a mathematical formula as a function.

Let first code it with simply using function and after it with recursion:

Now lets try the above program with the help of recursion :-

Hope you understand about Functions and Recursion. Please share it with your friends and help them learning python. In the next tutorial we will learn about some sorting algorithms like Bubble sort and Insertion sort.

John Veer

Contact mail id - john.veer.utube@gmail.com

Thanks for reading !

Comments

First Python Programme

If you are here, then I think you are a python enthusiast. On this website, we upload daily posts on new and basic programme for beginners. So let’s start with the first code i.e. Hello World programme. So first of all you you should know how to give print command in python. To print we write print(“Hello World”). What’s inside the small brackets will be printed. So the programme is : print("Hello World") Hello World So, as we can see above, when we implemented the print command, the thing between the small bracket is printed. So let’s see some other examples In this example, we will store an integer value in a variable. And then print the integer will the help,of that variable. So let’s get started a = 3 print(a) 3 Another example Now we will store a string into a variable and then print the string with the help of that variable #if we put hastag in front of any line in python. Then there is no effect. #for storing the string in a variable, we have to enclose the whole s...

Doubly Linked List in PYTHON

Here is the Python code for the Doubly Linked List :- #first of all creat a class node class Node : def __init__ ( self , data ): self . data = data self . next = None self . prev = None #now create a class of doubly linked list class DLL : def __init__ ( self ): self . head = None #function to insert the node at begining def insertatbeg ( self , data ): newnode = Node ( data ) newnode . prev = None newnode . next = self . head self . head = newnode #function to insert the node at the end def insertatend ( self , data ): newnode = Node ( data ) if self . head is None : self . head ...

Queues in PYTHON

The Python Code for Queue is here :- class Node: def __init__(self, data): self.data = data self.next = None class Queue: def __init__(self): self.front = self.rear = None def enqueue(self, data): newnode = Node(data) newnode.next = self.rear self.rear = newnode if self.front is None: self.front = newnode def dequeue(self): temp = self.rear while temp.next is not self.front: temp = temp.next self.front = temp temp.next = None def traverse(self): temp = self.rear while temp is not None: print(temp.data, end = " --> ") temp = temp.next print("None") new = Queue() new.enqueue(4) new.enqueue(1) new.enqueue(0) new.enqueue(2) new.traverse() new.dequeue() new.traverse() new.dequeue() new.traverse() 2 --> 0 --> 1 --> 4 --> None 2 --> 0 --> 1 --> None 2 ...

Basic Python Programs

Search This Blog