Recursive Function

I smell me a homework assignment.

std::next_permutation
std::prev_permutation

Quote:

Original post by arm I smell me a homework assignment.

no this is a general problem.
i only want to learn how can it can be done?
can you help me please? :)

nobody is interesting? :(

Every recursive function has a base case, a case where the function would simply return. Then there is the inductive case, where it would call itself but slightly changed the parameter that it drops down to the base case. If you are writing a fibonacci recursive function, we know that fibonacci formula is f_n = f_n-1 + f_n-2. The base case of fibonacci sequence is when n = 0 and n = 1. If n is 10, it calls itself for 9 and 8. The 9 will call for 8 and 7, and the 8 will call for 7 and 6, and so on until it reaches 0 and 1.

You just need to figure how permutation works, break it down to base and inductive case, then write the recursion.

Quote:

Original post by alnite Every recursive function has a base case, a case where the function would simply return. Then there is the inductive case, where it would call itself but slightly changed the parameter that it drops down to the base case. If you are writing a fibonacci recursive function, we know that fibonacci formula is fn = fn-1 + fn-2. The base case of fibonacci sequence is when n = 0 and n = 1. If n is 10, it calls itself for 9 and 8. The 9 will call for 8 and 7, and the 8 will call for 7 and 6, and so on until it reaches 0 and 1. You just need to figure how permutation works, break it down to base and inductive case, then write the recursion.

i have problems about writing this functions base and inductive case so i couldn't write the recursion.

i searched at internet and no answer for my question.

Quote:

Original post by Jingo std::next_permutation std::prev_permutation

Yeah, just go into the code for the STL header algorithm and you'll find how these are implemented. They're actually quite short.

low and high are supposed to indicate endpoints of a substring to permute.

What is the shortest possible length for a substring? What are the permutations of such a string?

Given a way to permute n characters, how can you permute n+1 characters? Hint: What are the possibilities for the first character of a permutation? Given the first character, what are the possibilities for the others?