Afn
the lit
ton t,w
tRsse alomen.
lemt (i++) anod
Meue to te neset
serted.
main.py Save Run Shell Clear
1 python program to do insertion sorting or ignal list: [10, 15, 41, 2, 25]
2 sortedlíst; (2, 10, 15, 25, 41]
3. def insertion_sor t(arr ):
for i in range(1,len(arr)):
5 key arr[i]
6 j-i-1
7: while j>=0 and key <arril:
8
arr(j"1]-arr[j]
9 j--1
arr[j+1]-key
11
12 mylist=[10,15,41 ,2,25]
3 print("orignal list:",mylist)
4 insertion_sort (myl ist)
15 print("sor tedlist;",mylíst)