By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
426,060 Members | 1,893 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 426,060 IT Pros & Developers. It's quick & easy.

a recursive function to print all possible permutations of a given string

P: 1
Write a recursive function to print all possible permutations of a given string. For
example if the input string is “abc” then the set of permutations is: abc, acb, bac,
bca, cab, cba. Hint: Generate all permutations that start with 'a',then 'b' then 'c'. To
generate permutations starting with 'a', we need to find all permutations of "bc"
May 18 '10 #1
Share this Question
Share on Google+
2 Replies

Expert 100+
P: 2,057
Hey, we did this homework question before!
How much have you figured out so far? Do you have an algorithm in mind to do this?
May 18 '10 #2

Expert 2.5K+
P: 3,525
Bytes has a policy regarding assisting students with their homework.

The short version is that the volunteers here can't help you with schoolwork.
A) We don't know what material you have and have not learned in class.
B) We don't know the guidelines you must follow.
C) In the long run giving you the answers actually short changes your education.

Hint 1: Try hitting Google with terms of your programming language and primary terms of what you want to do. For example "C# custom events" or "VB datagrid Excel". I've found this to be a very effective tool.
Hint 2: Your text book
Hint 3: Your instructor
Hint 4: Posting guidelines regarding homework assignments.

TIP: Read through the MSDN Library about each new control/method/area you are learning.
May 18 '10 #3

Post your reply

Sign in to post your reply or Sign up for a free account.