🚀 go-pugleaf

James Kanze US/ESC 60/3/141 #40763 (kanze@lts.sel.alcatel.de) wrote:
: In article <jbickers.167f@templar.actrix.gen.nz>
: jbickers@templar.actrix.gen.nz (John Bickers) writes:

: |> Quoted from <3vc96g$dnq@caip.rutgers.edu> by halasz@caip.rutgers.edu:
: |> > In article <huang.806961597@nickel.cs.umanitoba.ca>, huang@nickel.cs.umanitoba.ca (Hui Huang) writes

: |> > + As to the question of swapping the array, 
: |> > + if I haven't seen it before (I saw
: |> > + it in some textbooks), I would check out some 
: |> > + algorithm books and see if it

It is a special case of permuting an array as described in volume I
of Knuth's "Art of computer Programming" - Circa 1960 sometime.  Knowing
his style, it is probably set as one of the easier exercises...

The special cycles that are needed, are generated
by a version of Bresenham's algorithm.  That algorithm was studied in Brunel
University(UK) CS Dept in 1966..1976ish.  One of the properties
turned out to be importatn for getting a correct algorithm.

I don't expect a programmer to know about this how-ever.  

--
	dick@csci.csusb.edu=rbotting@wiley.csusb.edu.
Disclaimer:`CSUSB may or may not agree with this message`.
Copyright(1995):Copy this freely but include the following link to the
<a href="http://www.csci.csusb.edu/dick/signature.html">author's signature</a>