Sorting and merging on the DAP

The sorting problem is of fundamental importance in non-numerical algorithms. Many applications require the ordering of data based the relationship of some set of keys with in the data. Merging is a natural companion of sorting, and is known to yield a very efficient sorting algorithm in sequential processing. Numerous sorting and merging techniques have been developed for many actual and theoretical models, we examine a number of these techniques for implementation on the Distributed Array of Processors, DAP.