An algorithm questrion

Question

0.00/5 (No votes)

See more:

There is an problem about how to iterate all the situations of sorting.

Suppose there are 4 numbers:1,2,3,4, and how to display all the situations of sorting using C++ function , f(x) where x is the count of numbers.

example:
1234
1243
1324
1342
1423
1432
2134
2143
2314
2341
2413
2431
3124
3142
3214
3241
3412
3421
4123
4132
4213
4231
4312
4321

Posted 27-Jul-11 6:45am

virusx1984

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

«_Superman_» · Accepted Answer · 2011-07-27T07:43:00

Solution 1

The algorithm for this is already available in STL.
The function is called std::next_permutation and is available in the <algorithm> header.

Create a vector and push back the digits 1, 2, 3 and 4 into the vector.
Call next_permutation in a loop till it returns false with the vector::begin() and vector::end() methods as parameters.

Posted 27-Jul-11 7:43am

«_Superman_»

Comments

virusx1984 28-Jul-11 10:27am

thank you!