sorting the array in java code example
Example 1: Arrays.sort() in java
// how to sort an array in java without using sort() method (ascending order)
public class WithoutSortMethod
{
public static void main(String[] args)
{
int temp;
int[] arrNumbers = {14, 8, 5, 54, 41, 10, 1, 500};
System.out.println("Before sort: ");
for(int num : arrNumbers)
{
System.out.println(num);
}
for(int a = 0; a < arrNumbers.length; a++)
{
for(int b = a + 1; b < arrNumbers.length; b++)
{
if(arrNumbers[a] > arrNumbers[b])
{
temp = arrNumbers[a];
arrNumbers[a] = arrNumbers[b];
arrNumbers[b] = temp;
}
}
}
System.out.println("---------------");
System.out.println("After sort: ");
for(int num : arrNumbers)
{
System.out.println(num);
}
}
}
Example 2: sort array java
import java. util. Arrays;
Arrays. sort(array);
Example 3: sort array java
Here’s the java program to sort an array using Arrays.sort() method.
import java.util.Arrays;
public class JavaArraySortMethod
{
public static void main(String[] args)
{
String[] strGiven = {"Great Barrier Reef", "Paris", "borabora", "Florence","tokyo", "Cusco"};
Arrays.sort(strGiven);
System.out.println("Output(case sensitive) : " + Arrays.toString(strGiven));
}
}
Example 4: java sort method
Arrays.sort();//this method is an inbuild function in java
//to sort the array
Example 5: how to sort an array
import java.util.Scanner;
public class JavaExample
{
public static void main(String[] args)
{
int count, temp;
//User inputs the array size
Scanner scan = new Scanner(System.in);
System.out.print("Enter number of elements you want in the array: ");
count = scan.nextInt();
int num[] = new int[count];
System.out.println("Enter array elements:");
for (int i = 0; i < count; i++)
{
num[i] = scan.nextInt();
}
scan.close();
for (int i = 0; i < count; i++)
{
for (int j = i + 1; j < count; j++) {
if (num[i] > num[j])
{
temp = num[i];
num[i] = num[j];
num[j] = temp;
}
}
}
System.out.print("Array Elements in Ascending Order: ");
for (int i = 0; i < count - 1; i++)
{
System.out.print(num[i] + ", ");
}
System.out.print(num[count - 1]);
}
}