Skip to main content

Simplest Way to Sort an array in Java and Customized Sorting Of arrays in java

 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

Note:we can sort primitive array based on only default natural sorting whereas we cansort object arrays either based on default natural sorting or based on customized sorting.


Comments

Popular posts from this blog

Servlet Project Book Shop Application in eclipse

 Servlet Project Book Shop Application in eclipse  For explanation watch video::: Note :: In this Project you must configure web server (for example tomcat) with eclipse ide Download Bootstrap  from ::         https://getbootstrap.com/docs/4.3/getting-started/download/ Download mysql jar file from :: https://mvnrepository.com/artifact/mysql/mysql-connector-java/8.0.22 adding MySQL Connector/J jar file in eclipse ide for jdbc video :: video link : https://youtu.be/4Fyd-k3eG_I Directory Structure:: web.xml <?xml version="1.0" encoding="UTF-8"?> <web-app xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://xmlns.jcp.org/xml/ns/javaee" xsi:schemaLocation="http://xmlns.jcp.org/xml/ns/javaee http://xmlns.jcp.org/xml/ns/javaee/web-app_4_0.xsd" id="WebApp_ID" version="4.0">   <welcome-file-list>     <welcome-file>home.html</welcome-file>   </welcome-file-list>   <display-...

Java Regex Hackerrank Solution

 Java Regex Hackerrank Solution For Explanation Watch Video: Sample Input 000.12.12.034 121.234.12.12 23.45.12.56 00.12.123.123123.123 122.23 Hello.IP Sample Output true true true false false false Code: import  java.util.regex.Matcher; import  java.util.regex.Pattern; import  java.util.Scanner; class  Solution{      public   static   void  main(String[] args){         Scanner in =  new  Scanner(System.in);          while (in.hasNext()){             String IP = in.next();             System.out.println(IP.matches( new  MyRegex().pattern));         }     } } //Write your code here class MyRegex{   ...

Java Hashset Hackerrank Solution

 Java Hashset Hackerrank Solution For Explanation Watch Video: Sample Input 5 john tom john mary john tom mary anna mary anna Sample Output 1 2 2 3 3 Code: import  java.io.*; import  java.util.*; import  java.text.*; import  java.math.*; import  java.util.regex.*; public   class  Solution {   public   static   void  main(String[] args) {         Scanner s =  new  Scanner(System.in);          int  t = s.nextInt();         String [] pair_left =  new  String[t];         String [] pair_right =  new  String[t];                   for  ( int  i =  0 ; i < t; ...