Integer sorting in O(1) time on an n*n reconfigurable mesh
Stephan Olariu, Jim L. Schwing, Jinming Zhang · 1992
A constant-time integer sorting algorithm on a reconfigurable mesh is presented. More specifically, a sequence of n integers can be sorted in O(1) time on a reconfigurable mesh of size n*n. As applications of integer sorting, a constant-time algorithm to convert an edge-list representation of a graph to an adjacency-list representation and a constant-time algorithm to convert a parent-pointer representation of a rooted tree to standard form are described.>