said:
>> http://www-or.amp.i.kyoto-u.ac.jp/members/yagiura/papers/common95-e_abst.html
>> etc. for:
>> enumerate all permutations algorithm
>Thanks. Unfortunately it's in PostScript which I can't render here.
You could install GhostScript. Let me know if it's any good. I just
picked a likely suspect from the hits.
Try this one:
http://www.streamsec.com/howto.asp
This one appears to have everything you need, but the simple part. I
think the phi() function is Euler's phi() function, but I'm not sure.
>I did at first go to Google but was stymied by the massive number of
>references, and was hoping that someone could simply suggest a "best"
>algorithm. The best reference I have found so far is "Permutations by
>Interchanges" by B. R. Heath (1963) which Sedgewick claims is the fastest
>known, but finding Heath's paper was a chore. I have finally located it
>(in TIF format!) at The Oxford University Press in England.
No URL?
Steven
--
---------------------------------------------------------------------
"Steven Levine" MR2/ICE 2.37 #10183 Warp4/FP15/14.085_W4
www.scoug.com irc.webbnet.org #scoug (Wed 7pm PST)
---------------------------------------------------------------------
=====================================================
To unsubscribe from this list, send an email message
to "steward@scoug.com". In the body of the message,
put the command "unsubscribe scoug-programming".
For problems, contact the list owner at
"rollin@scoug.com".
=====================================================
<< Previous Message <<
>> Next Message >>
Return to [ 16 |
April |
2003 ]
The Southern California OS/2 User Group
P.O. Box 26904
Santa Ana, CA 92799-6904, USA
Copyright 2001 the Southern California OS/2 User Group. ALL RIGHTS
RESERVED.
SCOUG, Warp Expo West, and Warpfest are trademarks of the Southern California OS/2 User Group.
OS/2, Workplace Shell, and IBM are registered trademarks of International
Business Machines Corporation.
All other trademarks remain the property of their respective owners.
