merge_sort(A,l,r)
if l < r
m = (l+r)/2
merge_sort(A,l,m)
merge_sort(A,m+1,r)
merge(A,l,m,r)
merge(A,l,m,r)
n1=m-l+1
n2=r-m
i = l
j = m+1
k=0
for i<= m && j<= r
if A[i] < A[j]
B[k] = A[i]
i = i + 1
else
B[k] = A[j]
j = j + 1
k = k + 1
for i to m
B[k] = A[i]
i=i+1
k=k+1
for j to r
B[k]=A[j]
j=j+1
k=k+1
k=0
for l to r
A[l]=B[k]
k=k+1
l=l+1