I want the following algorithm to be converted to c language:
Mergesort(a,p,r)
2. if( p
3. q=(p+r)/2
4. mergesort(a,p,q)
5. mergesort(a,q+1,r)
6. merge(a,p,q,r)
for merge procedure,the algorithm is :
Merge(a,p,q,r)
1.n1=q-p+1
2.n2=r-q
3.create arrays L[1...n1+1] and R[1...n2+1]
4.for i=1 to n1
5. L[i]=a[p+i-1]
6.for j=1 to n2
7. R[j]=a[p+j]
8.L[n1+1]=infinity
9.R[n2+1]=infinity
10.i=1,j=1
11.for k=p to r
12. if L[i]<=R[j]
13. a[k]=L[i]
14. i=i+1
15. else a[k]=R[j]
16. j=j+1