L02 Sorting in Python | Insertion Sort | Class 12 Computer Science | Practical Example

#insertionsort #sorting #computerguruhub
In this video, I have covered insertion sorting technique of sorting algorithms. The topic is explained in deep manner along with its algorithm and practical example.

Program Code:
#Insertion Sort for ascending order

a=[10, 4, 25, 1, 5]
print("Original List",a)
for i in a:
j=a.index(i) #to get value 0,1,2,3 etc
while(j(greater than)0):
if a[j-1](greater than)a[j]:
a[j-1],a[j]=a[j],a[j-1] #swapping
else:
break
j=j-1
print("List after sorting: ",a)

Note: Replace Greater than with its sign while copy pasting the code.
This Channel is dedicated for providing free education. The purpose of the channel is to educate everyone from every category. You can find the simplest explanation of the most complex topic here.

fb page : https://www.facebook.com/computerguruhub/
Author on fb: https://www.facebook.com/sknager
Telegram Channel: https://t.me/computerguruhub
Telegram Group: https://t.me/computerguruhub1
if you want video on any particular topic, you can comment or contact.

Tags Used:

python class 12
class 12 python
insertion sort
insertion sort in python
python insertion sort
insertion sort program
python sorting
insertion sort in hindi
insertion sort analysis
insertion sort algorithm in hindi
insertion sort algorithm
insertion sort example
insertion sort algo
sorting techniques in python

#insertionsort #python #insertionsortalgorithm #class12python #sortingalgorithm #pythoninsertionsort #class12 #algorithm #cbse #insertionsort #insertionsortinpython #pythonsorting #computerscienceclass12 #insertionsortprogram #tutorial #sorting #pythonclass12 #sortingalgorithms #java #datastructures #programming #insertionsortalgorithm #sortingtechniquesinpython #class12boardexam #algorithms #class12computerscience #reddy #class11 #sortingtechniques #boardexam #datastructuresandalgorithms #howtostudy #pythonforclass12boardexam #navin #sort #pythonforclass12 #howtostudyforclass12computerscience