Abstract. This paper discusses sorting on a hypercube multicomputer, with the assumption that the data to be sorted is initially in the hypercube memory and the sorted data is to reside in the host memory. Three algorithmsheap-and-merge, cyclic merge, and embedded binary tree-are proposed. These are evaluated experimentally on an NCUBEI7 hypercube multicomputer. The cyclic merge algorithm is found to. have the best performance. Key words and phrases. Sorting, hypercube multicomputers 1