-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEXP1.py
44 lines (39 loc) · 876 Bytes
/
EXP1.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
import random
import time
def insertionsort(arr1,n):
t1=time.time()
for j in range(1,n):
key=arr1[j]
i=j-1
while i>=0 and arr1[i]>key:
arr1[i+1]=arr1[i]
i=i-1
arr1[i+1]=key
print(arr1)
t2=time.time()
print("Time taken for INSERTION SORT:", (t2 - t1), "seconds")
def selectionSort(arr2,n):
t1=time.time()
for j in range(n):
min=j
for k in range(j+1,n):
if arr2[k]<arr2[min]:
min=k
temp = arr2[j]
arr2[j] = arr2[min]
arr2[min] = temp
print(arr2)
t2=time.time()
print("Time taken for INSERTION SORT:", (t2 - t1), "seconds")
n = int(input("Enter Number of Elements:"))
arr=[]
for i in range(n):
arr.append(random.randint(0,100))
print("Original List:")
print(arr)
arr1=arr[:]
arr2=arr[:]
print("\nINSERTION SORT:")
insertionsort(arr1,n)
print("\nSELECTION SORT:")
selectionSort(arr2,n)