sorting algorithms java code example
Example 1: sort array java
import java. util. Arrays;
Arrays. sort(array);
Example 2: 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 3: sort algorithms java
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length-1-i; j++) {
if(arr[j]>arr[j+1])
{
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
System.out.print("Iteration "+(i+1)+": ");
printArray(arr);
}
return arr;
Example 4: Arrays.sort() in java
import java.util.Arrays;
public class Employee implements Comparable<Employee>
{
private String empName;
private int empAge;
public Employee(String name, int age)
{
this.empName = name;
this.empAge = age;
}
@Override
public String toString()
{
return "{" + "name='" + empName + '\'' + ", age=" + empAge + '}';
}
public String getName()
{
return empName;
}
public int getAge()
{
return empAge;
}
@Override
public int compareTo(Employee o)
{
if(this.empAge != o.getAge())
{
return this.empAge - o.getAge();
}
return this.empName.compareTo(o.getName());
}
}
public class SortArrayObjects
{
public static void main(String[] args)
{
Employee[] obj = { new Employee("virat", 25), new Employee("dhoni", 20),
new Employee("rohit", 22), new Employee("rahul", 24)};
Arrays.sort(obj);
System.out.println(Arrays.toString(obj));
}
}
Example 5: sorting in data structure
A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of element in the respective data structure.