| Permutation Example | Dijkstra Algorithm | Books | Links |
| a | b | c |
| a | c | b |
| b | a | c |
| b | c | a |
| c | a | b |
| c | b | a |
![]() |
recommend book⇒A Discipline of Programming | ||
| paperback | hardcover | ||
|---|---|---|---|
| ISBN13: | 978-0-13-215871-8 | 978-0-613-92411-5 | |
| ISBN10: | 0-13-215871-X | 0-613-92411-8 | |
| publisher: | Prentice Hall | ||
| published: | 1976-10-28 | ||
| by: | Edsger Wybe Dijkstra | ||
| See page 71 for the permutations algorithm. | |||
![]() |
and suggestions to improve this page to Roedy Green : | ||
| Canadian Mind Products | |||
| mindprod.com IP:[65.110.21.43] | |||
| Your face IP:[38.103.63.61] | The information on this page is for non-military use only. | ||
| You are visitor number 15,092. | Military use includes use by defence contractors. | ||
| You can get a fresh 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 | ||