Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
-------------------------------------------------------------------------------
Program:
========
mylist = [10,34,2,12,50,40,17]
n = len(mylist)
val = mylist[i]
hole = i
mylist[hole] = mylist[hole-1]
hole = hole - 1
if (hole != i):
mylist[hole] = val
=======
Before Sorting
After Sorting
-------------------------------------------------------------------------------
-------------------------------------------------------------------------------
Program:
========
def mergesort(a):
n = len(a)
if n==1:
return a
list1 = a[0:n//2]
list2 = a[(n//2) : n]
list1 = mergesort(list1)
list2 = mergesort(list2)
return merge(list1,list2)
if (a[0]>b[0]):
c.append(b[0])
b.pop(0)
else:
c.append(a[0])
a.pop(0)
while (len(a)>0):
c.append(a[0])
a.pop(0)
while (len(b)>0):
c.append(b[0])
b.pop(0)
return c
mylist = [14,33,27,10,35,19,42,44]
print("Before Sorting")
print(mylist)
print("After Sorting")
print(mergesort(mylist))
Output:
=======
Before Sorting
After Sorting
-------------------------------------------------------------------------------
-------------------------------------------------------------------------------
Program:
========
def check_prime(n):
flag = 0
for j in range(2,n):
if (n%j==0):
flag = 1
return flag
i=0
j=1
while (i<n):
flag = check_prime(j)
if (flag==0):
print(j)
i=i+1
j=j+1
Output:
=======
Enter N Value : 5
-------------------------------------------------------------------------------
-------------------------------------------------------------------------------
Program:
========
print("Matrix Multiplication")
matrix1 = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
matrix2 = [[10, 11, 12, 13], [14, 15, 16, 17], [18, 19, 20, 21]]
len_matrix1 = len(matrix1)
len_matrix2 = len(matrix2)
len_matrix2_row = len(matrix2[0])
for i in range(len_matrix1):
for j in range(len_matrix2_row):
for k in range(len_matrix2):
for r in rmatrix:
print(r)
Output:
=======
Matrix Multiplication