|
|
|
| "be consistent" | |
| PerlMonks |
Re: When the Best Solution Isn'tby blakem (Monsignor) |
| on Sep 23, 2002 at 03:01 UTC ( [id://199989]=note: print w/replies, xml ) | Need Help?? |
|
Aside from not being a fair shuffle (8 paths mapped to 6 end states) I believe it can actually cause older perls to dump core. Sorting assumes a transitive ranking function... If A > B and B > C then A > C. Returning random numbers for your comparison results wont comply with this requirement, and can wreak havoc depending on the internal sorting implementation. -Blake
In Section
Meditations
|
|
||||||||||||||||||||||