Abstract: The Banyan network is shown to have a computationally unsuitable structure for finding maximum passable subpermutations, which is prove d NP-complete. Using some non-blocking properties on the Cube and Reverse Banyan networks, a network topologically equivalent to the Batcher sorter, but functionally equivalent to the Batcher-Banyan network is derived for routing incomplete permutations. A log_2 N(2w-1) stage radix sorter for w-bit inputs, including duplicate inputs, that uses only log_2 N +1bit address headers for routing through each 2 log_2 N stages is shown, which can be used in sort-MIN type packet switches. Space-time sorting networks based on these principles are derive d, which can be used in hierarchical wavelength multiplexed optical networks.