home *** CD-ROM | disk | FTP | other *** search
/ C/C++ Interactive Guide / c-cplusplus-interactive-guide.iso / c_ref / clesson / c.dir / 00231.png < prev    next >
Portable Network Graphic  |  1995-04-05  |  4.8 KB  |  382x220  |  1-bit (2 colors)
   ocr: This is the heart ofthe algorithm. Suppose we start with keyllhaving the data given as mnardered in the table above. In the first pass ofthe outer loop k is 1. This is the first inner loop. The lirst calll to merge()is equivalent to merge(key*U, key+0+1, W+0, 1, 1); the second calll is merge(key+2, key+2+1, w+2,1, - - - - 1); thenext calland SO on.