permutation : Java Glossary

The JDisplay Java Applet displays the large program listings on this web page. JDisplay requires Java version 1.5 or later, preferably 1.6.0_18. If you can’t see the listings, or if you just want to learn more about JDisplay, click here for help.

permutation

If you take a set of objects and rearrange the order without taking any away or adding any, that is a permutation of the orginal set of objects. Permutations care about order where combinations do not. If you have n objects there are n! possible permutations of them.

Permutation Example

For example, the 3! = 6 permutations of three objects a, b and c are:

a	b	c
a	c	b
b	a	c
b	c	a
c	a	b
c	b	a

Dijkstra Algorithm

For code to generate them all see the Dijkstra algorithm. Here is an implemenation of the Dijkstra algorithm for permutations and also a combinations algorithm: view

Books

recommend book⇒A Discipline of Programming

paperback

hardcover

ISBN13:

978-0-13-215871-8

978-0-613-92411-5

publisher:

Prentice Hall

published:

1976-10-28

by:

Edsger Wybe Dijkstra

See page 71 for the permutations algorithm.

	abe books.co.uk	abe books.ca
	amazon.co.uk	amazon.ca
	abe books.de	chapters.indigo.ca
	amazon.de	abe books.com
	abe books.fr	amazon.com
	amazon.fr	barnes and noble.com
	abe books.it	powells.com
	iberlibro.com	sony e-books
	abe books anz

combinations
factorial
pseudo-random numbers
shuffle
Uncommon Maths: a library of permutation generators

	You can get the freshest copy of this page from:	or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
	http://mindprod.com/jgloss/permutation.html	J:\mindprod\jgloss\permutation.html
	Please email your feedback for publication, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green :
	Canadian Mind Products
	mindprod.com IP:[65.110.21.43]
view Blog	Your face IP:[38.107.191.110]
Feedback	You are visitor number 21,193.