given an integer,how can i find the next largest integer of it using the same digits

Question

2.67/5 (3 votes)

See more:

for example lets say i have an integer like 345. i want to write a function that will accept the integer which i can do, and return 354.i know i can extract the last digit 5 with a modolus operator(%) but then i need to swap the value with 4 and place 4 in the last position which i can do.But after all this,i dont know how to put at all the numbers back and return the completed integer which is 354.plz help me.It is an assignment for school.

Posted 2-Jul-12 2:14am

brian 3

Add a Solution

3 solutions

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)

idle63 · Answer 1 · 2012-07-02T02:44:00

Why not give a hint:

You know how to get the last digit by modulo.

How much is 345 / 10 (all values integer, including the result!)? If you don't know the answers debug it. And after that think again what you already know about modulo.

And so on and on and on for the other digits.

And after swapping the right digits recalculate your number d1 + d2 *10 + d3 *100 + .... Of course you will do that in a loop.

Regards.

Shemeer NS · Answer 2 · 2012-07-02T04:32:00

Solution 3

this may help you to develop the algo http://www.ardendertat.com/2012/01/02/programming-interview-questions-24-find-next-higher-number-with-same-digits/[^]

Posted 2-Jul-12 4:32am

Shemeer NS

brian 3 · Answer 3 · 2012-07-02T03:13:00

Solution 2

that might work for a number like 354 0r 454,but what about bigger numbers like 3456 0r 4567.iam really confused????

Posted 2-Jul-12 3:13am

brian 3

Comments

[no name] 2-Jul-12 9:22am

Do not post questions as answers. You can add comments.

Think about something like this:
int myNumber= 19372625;
while (myNumber > 0)
{
currentDigit= myNumber % 10;
// here put current digit to an array
....
// Prepare for next digit. you can write this shorter: myNumber/= 10;
myNumber= myNumber / 10;
}

After this you have the array of digits of your original number. Pay attention in which order you will have it.
Now you go throug this array until you find the two digits to swap. As soon you found it break the loop.
And then recalculate.

That's all I will tell you. Otherwhise you will not learn what you have to learn.
Regards

brian 3 2-Jul-12 10:29am

sorry i meant to say..i have figured out how to this...but iam been trying to modify the program in such a way that when a user enters a specified number like 345 or 2398 in the main portion of the program,the function that u have given me above will just perform the specified operation of returning the largest number still using the same digits of the number supplied by the user.

[no name] 2-Jul-12 15:48pm

You missed the comment "// here put current digit to an array" .... That is your job to solve ;)

Eugen Podsypalnikov 2-Jul-12 9:58am

// but what about bigger numbers like 3456 0r 4567

Very c00l ! Nearly all digits are the same ! 5ed :D