All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Algorithms
Permutations (Posted on 2003-07-02) Difficulty: 3 of 5
Find an algorithm (subroutine) that when called repeatedly with the same character-string variable that is initialized with n characters, all different, will cycle through all the permutations of those n characters, so that for example, when called 24 times with a string of length 4, will have cycled that string through all 24 permutations and returned it to its initial state.

See The Solution Submitted by Charlie    
Rating: 4.0000 (3 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Direct Index MethodAxorion2007-11-21 22:32:34
Another SolutionErik2004-06-02 09:10:10
re: SolutionCheradenine2003-07-04 00:21:09
re(2): Solutionfriedlinguini2003-07-03 18:20:38
Questionre: SolutionGamer2003-07-03 14:29:57
SolutionSolutionfriedlinguini2003-07-03 12:37:23
re(2): two waysCharlie2003-07-03 09:13:19
Hints/TipsHmmmGamer2003-07-03 08:36:38
re(2): two waysCheradenine2003-07-03 06:06:21
re: two waysfriedlinguini2003-07-03 06:00:48
Solutiontwo waysCheradenine2003-07-03 05:54:01
re: Not reallyfriedlinguini2003-07-03 05:15:31
Hints/TipsNot reallyGamer2003-07-03 03:08:17
Cheesy solutionfriedlinguini2003-07-02 08:47:59
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information