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

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 ...

Binary Search Tree and Binary Heap in PYTHON

Here is the Python code for Binary Search Tree :- Content included:- 1.) Insertion 2.) Search Operation 3.) Deletion 4.) Minimum Node 5.) Maximum Node 6.) Preorder Traversal 7.) InOrder Traversal 8.) PostOrder Traversal class BST: def __init__(self, data): self.root = data self.left = None self.right =None def insertnode(self, data): if self.root is None: self.root = data return if self.root is data: return elif self.root > data: if self.left is not None: self.left.insertnode(data) else: self.left = BST(data) elif self.root data: if self.left is not None: self.left.searchoprn(data) else: print("Data is not present.") elif self.root self.root: if self.right: selfright = self.right.deletenode(data) ...

Bubble Sort Algorithm in PYTHON

What is Bubble Sort ? And why do we need this ? Bubble sort is the simplest algorithm to sort any array. Due to its simplicity, bubble sort is often used to introduce the concept of a sorting algorithm. In computer graphics it is popular for its capability to detect a very small error (like swap of just two elements) in almost-sorted arrays and fix it with just linear complexity (2n). For example, it is used in a polygon filling algorithm, where bounding lines are sorted by their x coordinate at a specific scan line (a line parallel to x axis) and with incrementing y their order changes . ALGORITHM :- 1.) Firstly we have an unsorted list, which is to be sorted. 2.) Consider the first element of the list. Then compare it with the next element. 3.) If the second element is greator than the first element than swap them. 4.) If the second element is smaller than the first element, then we don't have to do anything. 5.) Going ahead, now after swap (may or may not), look for second...

Basic Python Programs

Search This Blog