create program in c for permutation combination and showing frequency

Posted by Vishal Oswal on Stack Overflow See other posts from Stack Overflow or by Vishal Oswal
Published on 2010-04-26T19:19:15Z Indexed on 2010/04/26 19:23 UTC
Read the original article Hit count: 267

Filed under:

combinations

I have 2 strings where I have saved fixed 20 characters and these are “A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T” and same 20 char in string 2. so I will get 400 combinations of 2 character sets like

AA,AB,AC,AD,AE,AF,……………AT

BA,BB,BC,BD,BE,BF,…………..BT

CA,CB,CC,CD,CE,CF……………CT

This way we will get 400 combinations (Which program I have created successfully) but then user will put the value till 31 characters witch will be treated as 3rd string for E.g. “ABCDDAAAB” now I have to check the frequency of user input in the sequence of 12,23,34,45,56,67,78,89 (2 CHAR SET) means AB,BC,CD,DD,DA,AA,AA,AB and need to show the frequency of user input

OUTPUT:

AB=2 BC=1 CD=1 DD=1 DA=1 AA=2

please its urgent

Related posts about permutation

Fast permutation -> number -> permutation mapping algorithms

as seen on Stack Overflow - Search for 'Stack Overflow'
I have n elements. For the sake of an example, let's say, 7 elements, 1234567. I know there are 7! = 5040 permutations possible of these 7 elements. I want a fast algorithm comprising two functions: f(number) maps a number between 0 and 5039 to a unique permutation, and f'(permutation) maps the… >>> More
Doing permutation of different arrays in perl

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello! I want to do permutation in perl. For example I have three arrays. ["big", "tiny", "small"] and then I have ["red", "yellow", "green"] and also ["apple", "pear", "banana"]. How do I get: ["big", "red", "apple"] ["big", "red", "pear"] ..etc.. ["small", "green", "banana"] I understand this… >>> More
Prolog: permutations check and multiple answers

as seen on Stack Overflow - Search for 'Stack Overflow'
Continuing to learn prolog, I'm trying to write a permutation(L1, L2) predicate. It should return true, only if L1 can be made up of all elements in L2. My code so far is the following: permutation([], []). permutation([H|T], L2) :- remove(L2, H, R), permutation(T, R). Assuming that the predicate… >>> More
Generating permutation in Python with specific rule

as seen on Stack Overflow - Search for 'Stack Overflow'
Let say a=[A, B, C, D], each element has a weight w, and is set to 1 if selected, 0 if otherwise. I'd like to generate permutation in the below order 1,1,1,1 1,1,1,0 1,1,0,1 1,1,0,0 1,0,1,1 1,0,1,0 1,0,0,1 1,0,0,0 Let's w=[1,2,3,4] for item A,B,C,D ... and max_weight = 4. For each permutation… >>> More
How can I use the Fisher-Yates shuffle while ensuring my permutation is even?

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm interested making an implementation of the 14-15 puzzle: I'm creating an array with the values 0 - 15 in increasing order: S = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } Now, what I want to do is shuffle them to create a new instance of the puzzle. However, I know that if I… >>> More

Developer IT