Navigation ... |
|
|
Scientific Writing ... |
|
|
|
|
|
|
|
|
|
|
|
|
|
Other Writing ... |
|
|
|
|
Reference details
| Author(s) | Year | Title | Reference | View/Download |
|---|---|---|---|---|
Les Hatton | 2007k | Unsorting: an easy way of generating random permutations of an array | WEB | unsorting_Apr_2007.pdf |
Synopsis and invited feedback
Peer review is important and acquiring competent reviewers is becoming a major problem for the journals today so I will be very happy to include constructive comment (positive or negative) with acknowledgement. If I am not competent to judge your commentary I will try and find somebody who is.
If you would like to provide feedback just e-mail me here.
| Synopsis | Invited Feedback | Importance (/10, author rated :-) ) |
|---|---|---|
I'm sure this must have been done before but couldn't find it anywhere - so maybe its too obvious. I needed to find a simple way of generating permutations of an existing array. All you have to do is run a sorting program backwards randomising its choices, so I called it unsorting :-). | It has. Chris Walker of Microsoft kindly pointed out this excellent reference:- http://en.wikipedia.org/wiki/Knuth_shuffle. Apparently I was in good company because this algorithm appears to have been invented at least 3 times independently. Mine is slower but I only had to hack, er, re-engineer :-) 2 lines of an existing algorithm. Thanks Chris. | 8 |
Related links
| Related papers and links |
|---|
| Sorry, no links registered in database yet. |
Auto-generated: $Revision: 1.43 $, $Date: 2008/03/03 23:38:56 $, Copyright Les Hatton 2001-