How do I sort the digits in ascending order such that zero always come in the 2nd position without using array.

Question

0.00/5 (No votes)

See more:

i

Java

mport java.util.*;
public class sort1 {
	public static void main(String args[])
	{
		int num,sort=0;
		System.out.println("enter a no.\n");
		Scanner s=new Scanner(System.in);
		num=s.nextInt();
		for(int i=0;i<=9;i++)
		{
			int temp=num;
			while(temp>0)
			{
				int d=temp%10;
				
				if(d==i)
					sort=sort*10+d;
				
				temp=temp/10; 
				
			}
		}
		System.out.println(sort);
	}

}

What I have tried:

i'm trying the above code which is working fine but it doesn't include zero.I want the zero as 2nd digit.

Posted 19-Aug-18 23:17pm

Member 13954890

Updated 20-Aug-18 1:26am

OriginalGriff

v2

Add a Solution

2 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)

OriginalGriff · Answer 1 · 2018-08-19T23:52:00

Solution 1

If you mean "I want a zero in the least significant digit position" then try this:

int digits = log10(num) + 2;
sort = 0;
int temp = num;
while (digits-- > 0)
    {
    int d = temp % 10;
    temp /= 10;
    sort = sort * 10 + d;
    }

If you don't, then you will need to explain in a lot better detail!

Posted 19-Aug-18 23:52pm

OriginalGriff

Comments

Member 13954890 20-Aug-18 12:16pm

It doesn't sort the digits in ascending order.I want to sort all the digits of a no. in ascending order.(except 0 which should always occupy the 2nd position such that the length of the no. remains same)
e.g. input: no.=692204 output: 220469
input: no.=790402 output: 200479

OriginalGriff 20-Aug-18 12:32pm

That's different: the easiest way to do that is to allocate an array big enough to hold each digit in a separate element (int or even just byte) then separate out each digit into a separate element. (You can get the number of elements your need with log10(yourNumber) + 1, that's what log10 effectively does).

You can then sort the individual digits in the array, and print them each from there.

The more complex method is to do the sorting "in the integer" but to be honest that's a pain in the ass to do. For the number of digits in an integer, I wouldn't bother.

Member 13954890 20-Aug-18 14:47pm

Sorry! I'm not getting you.Will you please help me with code? Thanking you in advance.

OriginalGriff 20-Aug-18 15:02pm

No, it's your homework not mine!
Any way you know everything you need to do it. You know how to extract each digit separately, I know that. And you know how to use arrays, and how to sort, don't you?

Richard MacCutchan · Answer 2 · 2018-08-20T01:26:00

Solution 2

There is a difficulty in printing a number with one significant zero, especially as you do not know if there is a zero in the number to begin with, and you do not know its length. The easiest way to do this would be to read the number as a string and than split it into characters and sort the characters in alphabetic order.

Posted 20-Aug-18 1:26am

Richard MacCutchan

Comments

Member 13954890 20-Aug-18 14:19pm

hey! I want to sort it in descending order.Since i'm using primitive datatype i can't use sort(arr.Collections.reversedorder).Then what is the alternative?Here is my code:
import java.lang.*;
import java.util.*;

public class sort_string
{
public static void main(String[] args)
{
//String result = "";
System.out.println("enter string\n");

Scanner kbd = new Scanner(System.in);
String input = kbd.nextLine();
char[] arr=input.toCharArray();
Arrays.sort(arr);
String sorted=new String(arr);
System.out.println(sorted);
}
}
the above code is working fine but it takes 0 in the first position.I want something like that-> input:936703 output:303679 so that the length of a no. remains same.

Richard MacCutchan 21-Aug-18 3:33am

You will need to write your own method to handle that case. Basically, just sort the digits and check if the first character is '0'.