Hey Darry!, the question is algorithmic question it's not about strings,it's a part of a huge algorithm currently implement it,i've just simplified the questions to strings so you may understand what do i want? I want to find the best solution recursively or not recursive from the public you dont' need to talk about recommendation in SCJP, i'm currently doing a FYI. Hi Peter, i want to stor every solution as described in my last post in char array. Pico X Chico Ova more. it's not ABCD. It may be ABCDEFGJKSLDLFD. The length is variable. Alaa salameh wrote:I mean you can reverse and but the size of each array should be N. EX: let ABCD the string, ACB will not be accepted the length should be the same length of the original string,So it's not permutation, and we will get N!

C program for combination.Combination is way of selecting a set of things out of a group. C program made to find permutation is similar. The main difference. Program For All Combination of the Given. Tags for Program For All Combination of the Given String in C. Of a string using c; c program to find combination of. I'm trying to allow a user to enter text in a textbox, and have the program generate all possible combinations of it, except with a minimum of 3 characters and. I am trying to print all possible combinations of the string 'abc' using C. All possible combinations in a string in C. Stdlib.h>void combination.

Actually, what you just described is exactly what a permutation is. Alaa salameh wrote: i want to find the best solution recursively or not recursive from the public you dont' need to talk about recommendation in SCJP, i'm currently doing a SCJD FYI. This is pretty much a standard problem for recursion to solve. In fact, what you described is a homework problem for recursion, in many cases. IMHO, recursive is the best solution to this problem. Monopoly Worldwide Edition Pc.