NPTEL IIT Guwahati

Merge Sort:

Print this page

Pseudocode of the merging is given below.

Algorithm Merge (a[p], b[q])

Step 1:

i = 0

Step 17:

else

Step 18:

Step 2:

j = 0

while(i < p) do

Step 19:

Step 3:

k = 0

{ c[k] = a[i] ;

Step 20:

Step 4:

while (i < p) && (j < q) do {

k = k + 1 ;

Step 21:

Step 5:

if (a[i] < b[j]) {

i = i + 1 ;

Step 6:

c[k] = a[i] ;

}

Step 7:

i = i + 1 ; }

Step 8:

else {

Step 9:

c[k] = b[j]

Step 10:

j = j + 1 }

Step 11:

k = k + 1 }

Step 12:

if (i == p) then

Step 13:

while ( j < q) do {

Step 14:

c[k] = b[j] ;

Step 15:

k = k + 1 ;

Step 16:

j = j + 1 ;

}

First | Next | Last