Given two sets of strings set a="b8","b7",,,,...."b1" set b="c2","c1","c0"
I wish to list out all the permutations of the form b8c2 b7c2 b6c1 b5c1 b5c0 b5c0 b1c0 b1c0 of length 8 each wherein the ordering is maintained like non increasing indices from set a and also from set b. A more formal defintion of the requirement would be to generate 8 tuple permutations of the form bindex1cindex1 bindex2cindex2..............bindexcindex8 where index1>=index2>=index3>=...index8 for both b and c What would be the suggested algorithm -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
