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

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

Quicksort Algorithm and Data structure in PYTHON

  So, now what is Quicksort ? Quicksort, or partition-exchange sort, is a sorting algorithm developed by Tony Hoare that, on average, makes O comparisons to sort n items. In the worst case, it makes O comparisons, though this behavior is rare. Quicksort is often faster in practice than other O algorithms. Additionally, quicksort's sequential and localized memory references work well with a cache. Quicksort is a comparison sort and, in efficient implementations, is not a stable sort. Quicksort can be implemented with an in-place partitioning algorithm, so the entire sort can be done with only O additional space used by the stack during the recursion. Properties of Quicksort :- The quick sort is an  in-place, divide-and-conquer, massively recursive sort algorithm . The efficiency of the algorithm is majorly impacted by which element is chosen as the pivot point. The worst-case efficiency of the quick sort is o (n²) when the list is sorted and left most element is chosen as the p...
Post a Comment
Read more

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