The Balanced Sorting Network

  title={The Balanced Sorting Network},
  author={Martin Dowd and Yehoshua Perl and Michael E. Saks},
This paper introduces a new sorting network, called the <underline>balanced sorting network</underline>, that sorts n items in <italic>O</italic>([lg<italic>n</italic>]<supscrpt>2</supscrpt>) time using (<italic>n</italic>/2)(lg<italic>n</italic>)<supscrpt>2</supscrpt> comparators. Although these bounds are comparable to many existing sorting networks, the balanced sorting network possess some distinct advantages. In particular, its structure is highly regular consisting of a sequence of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications referenced by this paper.
Showing 1-2 of 2 references

The art of ~:0mputer uroaramminq

D. E. Knuth
Vol. 3: Sorting and searching, Addison Wesley, Reading, MA • 1973
View 5 Excerpts
Highly Influenced

and M

M. bowd, Y. Perl, L. Rudolph
Saks, "The Balanced Sorting Network," DCS-TR-127, Dept. Computer Science, Rutgers University, New Brunswick, NJ, • 1983
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…