Improved sorting networks withO(logN) depth
- Cite this article as:
- Paterson, M.S. Algorithmica (1990) 5: 75. doi:10.1007/BF01840378
- 267 Views
The sorting network described by Ajtaiet al. was the first to achieve a depth ofO(logn). The networks introduced here are simplifications and improvements based strongly on their work. While the constants obtained for the depth bound still prevent the construction being of practical value, the structure of the presentation offers a convenient basis for further development.