<None>

Article View: comp.theory

Article #1804

#1804

From: cip
Date: Thu, 13 Jun 1991 17:07

7 lines
539 bytes


Hi. 
I need an efficient algorithm to generate all (n-1)! cyclic permutations
of first n integers. I would appreciate any information on references or
ideas. Thanks in advance.
Zeynep Serifsoy (zserifso@coegld.eng.miami.edu)

Technical Details

Message-ID: <1991Jun13.130738.10600@umiami.ir.miami.edu>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!asuvax!ncar!news.miami.edu!umiami!cip

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!asuvax!ncar!news.miami.edu!umiami!cip
From: cip@umiami.ir.miami.edu
Newsgroups: comp.theory
Subject: <None>
Message-ID: <1991Jun13.130738.10600@umiami.ir.miami.edu>
Date: 13 Jun 91 17:07:38 GMT
Organization: Univ of Miami IR
Lines: 7