AN ANALYSIS OF SORTING NETWORKS

Barnard Smith · DSpace@MIT (Massachusetts Institute of Technology) · 1972

Comparators which sort two numbers can be interconnected to form networks which sort n numbers for any n. The input and output characteristics of comparator networks are analyzed from several different points of view.

Read the paper · More papers on PaperTik