Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #merge sort on array of structures (C) list of Objects(Python)
- class node:
- def __init__(self,age):
- self.age=age
- import random
- a=[]
- for i in range(10):
- a.append(node(random.randint(4,100)))
- for i in a:
- print(i.age,end=" ")
- print()
- def merge(a):
- if len(a)<=1:
- return
- n=len(a)
- m=n//2
- L,R=a[:m],a[m:]
- merge(L)
- merge(R)
- i,j,k=0,0,0
- while i<len(L) and j<len(R):
- if L[i].age<R[j].age:
- a[k]=L[i]
- i=i+1
- else:
- a[k]=R[j]
- j=j+1
- k=k+1
- while i<len(L):
- a[k]=L[i]
- i,k=i+1,k+1
- while j<len(R):
- a[k]=R[j]
- j,k=j+1,k+1
- merge(a)
- for i in a:
- print(i.age,end=" ")
- print()
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement