Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/18/84; site brl-tgr.ARPA Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!godot!harvard!seismo!brl-tgr!gwyn From: gwyn@brl-tgr.ARPA (Doug Gwyn) Newsgroups: net.lang.c Subject: Re: Need C Algorithm Message-ID: <6640@brl-tgr.ARPA> Date: Tue, 18-Dec-84 13:46:44 EST Article-I.D.: brl-tgr.6640 Posted: Tue Dec 18 13:46:44 1984 Date-Received: Thu, 20-Dec-84 00:30:24 EST References: <1289@eosp1.UUCP> Distribution: net.unix-wizards,net.unix,net.lang,net.puzzle Organization: Ballistic Research Lab Lines: 7 There is a permutation generator in the Collected Algorithms of ACM (long ago, so probably in the bound Vol. 1). You can also design a permutation generator by recursive application of the rule: Perm( N ) = { N-inserted-at-each-position-in-Perm( n-1 ) } This makes a pleasant programming exercise.