ocr: This is the heart ofthe algorithm. Suppose we start with keyllhaving the data given as unardered in the table above. In the first pass ofthe outer loop k is 1. This is the first inner loop. The first call to merge()is equivalent to merge(key+0, key+0+1, W+0, 1, - 1); the second callis merge(key+2, key+2+1, w+2,1,1); the next calll.. and so on.