Skip to main content

Loops in PYTHON (For loop and While loop)

Why do we need loops in python ? And how it makes our codes more simpler and shorter ? 

Sometimes we want to repeat a set of statements in our programme for instance.

If we want to print 1 - 1000 in our python programme. Then it is not easy to print every number separately. Thus we need loops because using only 2-3 lines of code we can do this.

Loops make it easy for a programmer to tell the computer, which set of instruction to repeat as much as times we want.


Types of loops in Python :-

1.) While loop

2.) For loop

We will look into these one by one !

1.) WHILE LOOP :-

The syntax of a while loop looks like this :

while(condition):
    #code accordingly
    #this code will keeps working until the condition is satisfied

In while loops, the condition is checked first. If comes true, the body code will starts running else not.
If the loop is started it will runs until the condition becomes false.

Now lets write a code to print all the numbers from 1 - 100 :-



Now another code to print all the numbers from 1-100 which are divisible 3 :-






2.) FOR LOOP :-

A for loop is used to iterate through a sequence like list, tuple, or string.
The syntax of the for loop is :-

mylist  =  [4, 2, 8, 4, 78]
for i in range(0, len(mylist)+1):
     print(mylist[i])

Now we will try the same programmes for For loop which were used in the while loop section.

First code to print the number from 1-100 :-



Now the second code is to print all the numbers from 1-100 which are divisible by 3 :-




Now we have the basic knowledge of the loops and rest depends on your practice.

What are break statements in python loops ? And to use them in our code ?

Break is used to come out of the loop when encountered. It instructs the programme to exit the loop now.

Use in code :-





Hope you like this tutorial. Please share it with your friends and help them learning python. In the next tutorial we will learn about function and recursion in python.



John Veer
Contact mail id  -  john.veer.utube@gmail.com
Thanks for reading !
                                                                         

Comments

Post a Comment

Popular posts from this blog

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 ...
Post a Comment
Read more

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) ...
Post a Comment
Read more

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...
Post a Comment
Read more