Algorithm for nPk permutations ?

Math and Physics Programming

Started by xxx_shinobi May 20, 2006 12:38 PM

2 comments, last by Fruny 17 years, 11 months ago

142

Author

May 20, 2006 12:38 PM

Hello. I really need some algorithm for finding all nPk permutations (ordered sub-sets with lenght = k) Number of such permutations is n!/(n-k)! Thanks in advance.

Fruny

1,658

May 20, 2006 01:07 PM

If programming in C++, you can use the std::next_permutation and std::prev_permutation functions. The source code is available (in the <algorithm> header) in case you want to see the implementation (and thus the algorithm).

"Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it." — Brian W. Kernighan

xxx_shinobi

142

Author

May 20, 2006 01:27 PM

Quote:Original post by Fruny
If programming in C++, you can use the std::next_permutation and std::prev_permutation functions. The source code is available (in the <algorithm> header) in case you want to see the implementation (and thus the algorithm).

Is there something in .NET platform for nPk ?

Fruny

1,658

May 20, 2006 01:58 PM

Quote:Original post by xxx_shinobi
Is there something in .NET platform for nPk ?

I don't know. I doubt it. Check the documentation.

Algorithm for nPk permutations ?

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

Algorithm for nPk permutations ?

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

Reticulating splines