JAVA program for sorting the elements in the array?

Answer 1

If you are really lazy, like me, I just use what Java 5.0 has advailable.

Just call Arrays.sort();

put your data structure as the parameter, it is a void method.

i.e.

int [] arr = { 2,31, 2, 1, 42, 34, 42, 1337, 101 };

Arrays.sort( arr );

//now arr is sorted, yay the magic of Java.

Answer 2

class sorting

{

public static void main(String as[])

{

int[] num={7,4,5,9};

int l=num.length;

int i,j;

for(i=1;i<l;i++)

{

System.out.println(" "+num[i]);

}

System.out.println("\n");

System.out.println("Ascending order");

Arrays.sort(num);

for(i=0;i<l;i++)

{

System.out.println(""+num[i]);

}

}

}

Answer 3

class Sort

{

public static void main(String args[])

{

int arr;

int arr = 4,8,3,2,5,6;

array.sort(arr);

System.out.println("sort the given numbers in ascending order");

}

}

Answer 4

import java.util.*;

class table

{

public static void main (String argsp[])

{

Scanner in = new Scanner (System.in);

int a,b,c,d=0;

System.out.print ("\n\t Enter the number to print table = ");

a=in.nextInt();

System.out.print ("\n\t Enter 1 for ascending and 2 for descending order = ");

c=in.nextInt();

if (c==1)

{

System.out.println ("\n\t Table of "+a+" in ascending order ");

b=1;

while (b<=10)

{

d=b*a;

System.out.println ("\n\t "+a+" * "+b+" = "+d);

++b;

}

}

else if (c==2)

{

System.out.println ("\n\t Table of "+a+" in ascending order ");

b=10;

while (b>0)

{

d=b*a;

System.out.println ("\n\t "+a+" * "+b+" = "+d);

--b;

}

}

else

System.out.println ("\n\t Invalid number ");

}

}

Answer 5

import java.util.*;

public class array

{

public static void main(String[]args)

{

int num[]={5,4,3,2,1,0};

int l=num.length;

int i,j;

System.out.println("given number");

for(i=0;i<l;i++)

System.out.println(""+num[i]);

}

System.out.println("\n");

System.out.println("ascending order");

Array.sort(num);

for(i=0;i<l;i++)

{

System.out.println(" "+num[i]);

}

}

Answer 6

If it is for a programming exercise, I suggest the bubble sort, which is fairly simple to implement (but not very efficient for large arrays). The basic idea is to compare consecutive elements with one another; if they are out of order (the first is greater than the second, if you want an ascending order), exchange them. Repeat this until you reach the end of the array. Then, repeat the whole cycle over and over again, until all elements are sorted.

Answer 7

Get the input; store it in an Array or perhaps an ArrayList; sort it; print the result out.

For the ordering, you might use a bubble sort - this is not very efficient, but fairly easy to program.

Answer 8

I suggest you use a bubble sort, to keep it simple. That is, if the array has (for example) 10 elements, just compare element #1 and element #2, and exchange if they are out of order, then do the same for elements #2 and #3, etc., up to elements #9 and #10. Then repeat from the beginning, either a total of 9 times (assuming 10 elements), or until no elements were found that are out of order.

Answer 9

I would suggest you try something simple, like a bubble sort. It isn't very efficient for large arrays, but it works.