How to write Short Java program to sort a sequence of numbers 2345 12 1 111 in ascending order?

Answer 1

Do you mean how do you write a Java program to print out those numbers in ascending order? Because you have specified thosenumbers, I can only assume that the following will suffice:-

public int main( String[] args )

{

System.out.println( "0.235 4.62 7.25 7.89 23.5" );

}

If you want to know how to sort a general array into ascending order, try Google for sorting algorithms, such as "bubble sort", "insertion sort", "heap sort", "quick sort" etc.

Answer 2

class Bubblesort{

public static void main(String a[]){

int i;

int array[] = {2345,12,1,111};

System.out.println("Values Before the sort:\n");

for(i = 0; i < array.length; i++)

System.out.print( array[i]+" ");

System.out.println();

bubble_srt(array, array.length);

System.out.print("Values after the sort:\n");

for(i = 0; i <array.length; i++)

System.out.print(array[i]+" ");

System.out.println();

System.out.println("PAUSE");

}

public static void bubble_srt( int a[], int n ){

int i, j,t=0;

for(i = 0; i < n; i++){

for(j = 1; j < (n-i); j++){

if(a[j-1] > a[j]){

t = a[j-1];

a[j-1]=a[j];

a[j]=t;

}

}

}

}

}

Answer 3

It should be fairly simple to program a bubble sort (though this is not very efficient for large arrays). If elements #0 and #1 of an array are out of order, exchange them. Then do the same with elements #1 and #2, etc., up to elements number (n-2) and (n-1). Then go back to the beginning, and repeat everything (n-1) times. (This will require two nested for loops.)

Answer 4

To sort any array of numbers, use the built in Arrays.sort() methods.

int[] array = new int[]{2345, 12, 1, 111};

Arrays.sort(array);

Answer 5

I suggest you do a bubble sort; that one is fairly easy to implement.