While Loop

'''
While Loop:
The 'while' loop as the name suggests, execute statements while the condition is True.
As soon as the condition becomes False, the interpreter comes out of the while loop.
'''

for i in range(3):
    print(i)
#output = 0
#         1
#         2

i = 0
while(i<3):
    print(i)
    i = i + 1
#output = 0
#         1
#         2

x = 2
while(x <= 10):
    print(x)
    x = x + 2
print("Done with the loop")
#output = 2
#         4
#         6
#         8
#         10
#         Done with the loop

y =int(input("Enter the number: "))
while(y <= 38):
    y = int(input("Enter the number: "))
    print(y)
print("Done with the loop")
#Enter the number: 10
#10

#Enter the number: 38
#38

#Enter the number: 100
#Done with the loop

count = 5
while(count > 0):
    print(count)
    count = count - 1
else:
    print("I am inside else")
#output = 5
#         4
#         3
#         2
#         1
#I am inside else

#Here the count variable is set to 5, which decrements after each iteration.
#Depending upon the while loop condition, we need to either increment or decrement the count variable(the variable count, in our case) or the loop will continue forever.

'''
Else with While Loop:
In Python, as soon as the while loop condition becomes false, the interpreter comes out of the while loop and else statement is executed.
'''

count = 1
while count <= 5:
    print("This is loop number", count)
    count += 1
#output = This is loop number 1
#         This is loop number 2
#         This is loop number 3
#         This is loop number 4
#         This is loop number 5

'''
Do-While Loop in Python:
It is a loop in which a set of instructions will execute at least once(irrespective of the condition) and then the repetition of the loop's body will depend on the condition passed at the end of while loop.
'''




 


Comments

Post a Comment

Popular posts from this blog

Sets in Python

''' Python Sets: In Python, a set is an unordered collection of unique elements.  Sets are useful when we need to store a collection of items without any duplicates. Key Characteristics of Sets: 1. Unordered: The items have no defined order, and their position can change. 2. Unique Elements: No duplicate values are allowed. 3. Mutable: Sets can be modified after creation (elements can be added or removed). 4. Heterogeneous: A set can contain elements of different data types. ''' s1 = {1, 2, 3, 4} print(s1)                #output = {1, 2, 3, 4} s2 = {1, 1, 2, 3, 4, 4} print(s2)                #output = {1, 2, 3, 4}   #Duplicates are automatically removed info = {"Sindhu", 24, True, 2002} print(info)              #output = {24, True, 2002, 'Sindhu'}  #Here we can see that the items in set occur in random order, and hence they cannot be accessed using index...
Read more

String Slicing and Operations on Strings

names = "Sindhu , Shilpa" print(names[0:6])      #output = Sindhu #print(names[1st index:(n-1)th index]) where (n-1)=5 ''' In Programming, counting always starts with 0. Length of a String: We can find the length of a string using len() function. ''' print(len(names))#output = 15 fruit = "Orange" len1 = len(fruit) print("Orange is a" ,len1, "letter word.") #output = Orange is a 6 letter word. '''For functions, we use parenthesis and for string slicing, we use square brackets.''' alphabets = "ABCDE" alphabetslen = len(alphabets) print(alphabetslen)      #output = 5 print(alphabets[0:4])    #output = ABCD print(alphabets[ :4])    #output = ABCD # In case, we do not put any index at the place of 1st index, Python considers it as 0 by default. print(alphabets[1:4])    #output = BCD #print(alphabets[1st index:3rd index]) i.e. including 1 but not 4 print(alphabets[:])     #output = ABCDE #In cas...
Read more

Recursion in Python

''' Recursion in Python: It is the process of defining something in terms of itself. A physical world example would be to place two parallel mirrors facing each other. Any object in between them would be reflected recursively. ''' ''' Python Recursive Functions: In Python, we know that a function can call other functions. It is even possible for the function to call itself. These types of functions are termed as recursive functions. ''' #factorial (7) = 7*6*5*4*3*2*1 #factorial (6) = 6*5*4*3*2*1 #factorial (5) = 5*4*3*2*1 #factorial (0) = 1 #factorial (n) = n * factorial (n-1) def factorial(n):     if(n == 0 or n ==1):         return 1     else:         return n * factorial (n-1) #Here we have called the function factorial (n-1) with function factorial (n).      print(factorial (3))             #output = 6 print(factorial (4))             #outp...
Read more