This is comparison based sorting. Playing cards is an example of insertion sort.
Source Code:
def insertion(a,n):
for i in range(n):
temp=a[i]
j=i
while j>0 and a[j-1]>temp:
a[j]=a[j-1]
j=j-1
a[j]=temp
a=[]
n=int(input("Enter number of elements"))
for i in range(n):
a.append(int(input()))
print("list before sorting")
print(a)
insertion(a,n)
print("list after sorting")
print(a)
Source Code:
def insertion(a,n):
for i in range(n):
temp=a[i]
j=i
while j>0 and a[j-1]>temp:
a[j]=a[j-1]
j=j-1
a[j]=temp
a=[]
n=int(input("Enter number of elements"))
for i in range(n):
a.append(int(input()))
print("list before sorting")
print(a)
insertion(a,n)
print("list after sorting")
print(a)
Output:
Python 3.4.0 (v3.4.0:04f714765c13, Mar 16 2014, 19:24:06) [MSC v.1600 32 bit (Intel)] on win32
Type "copyright", "credits" or "license()" for more information.
>>> ================================ RESTART ================================
>>>
Enter number of elements5
10
30
20
11
5
list before sorting
[10, 30, 20, 11, 5]
list after sorting
[5, 10, 11, 20, 30]
>>>
No comments:
Post a Comment