Mathematica MathWorld Wolfram Science More »

HOME

TOPICS

LATEST

Sorting Networks

Starting from the left, a sorting network does a sequence of comparisons, interchanging elements if they are out of order. The network is set up so that by the time the data reaches the right-hand end, all the elements are sorted. Notice that better sorting networks tend to look more complex.

Contributed by: Stephen Wolfram

Show Initialization Code

(29 lines omitted)

Not all types of sorting networks exist for every number of elements. Optimal networks are not yet known for more than 16 elements.

For less than 9 elements, there are no unique optimal sorting networks. Here the Batcher method achieves the minimal number of comparators for each case.

Sorting (Wolfram MathWorld)

Sorting networks (NKS|Online)

"Sorting Networks" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/SortingNetworks/

Contributed by: Stephen Wolfram

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Browse all topics

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

Wolfram Research

Site Index

RSS

Atom