Simplest Way to Sort an array in Java and Customized Sorting Of arrays in java
Do Check My Video On Utility Classes:
Arrays:
Arrays class is the utility class to define the several utility methods for the array objr=ect
Array class defines the following methods to sort the array
1)public static void sort(Primitive[] P):
to sort acc. to natural sorting order
2)public static void sort(Object[] P):
3)public static void sort(Object[] o,Comparator c):
sort acc to customized sorting order
Example:
import java.util.Arrays;
import java.util.Comparator;
public class Test{
public static void main(String[] args) {
int[] a = {10,5,20,11,6};
System.out.println("Primitive array before sorting: ");
for(int a1:a){
System.out.print(""+a1+" ");//10 5 20 11 6
}
Arrays.sort(a);
System.out.println();
System.out.println("Primitive array after Sorting : ");
for(int a1:a) {
System.out.print("" + a1 + " ");//5 6 10 11 20
}
System.out.println();
String[] s = {"s","e","g"};
System.out.print("Objects Before sorting: ");
for (String s1:s){
System.out.print(s1+" ");//s e g
}
Arrays.sort(s);
System.out.println();
System.out.print("objects after sorting: ");
for (String s1:s){
System.out.print(s1+" ");//e g s
}
Arrays.sort(s,new MyComparator());
System.out.println();
System.out.println("Object array after sorting by comparator: ");
for(String a1:s){
System.out.print(a1+" ");//s g e
}
}
}
class MyComparator implements Comparator{
public int compare(Object obj1,Object obj2){
String s1 = obj1.toString();
String s2 = obj2.toString();
return s2.compareTo(s1);
}
}
o/p:
Primitive array before sorting:
10 5 20 11 6
Primitive array after Sorting :
5 6 10 11 20
Objects Before sorting: s e g
objects after sorting: e g s
Object array after sorting by comparator:
s g e
Comments
Post a Comment