All sorting program in java

Sorting Arrays in Java

Learn to sort a Java array of primitives, strings and custom objects in multiple ways with the help of Comparable and Comparator interfaces, Arrays.sort() and Stream.sorted() APIs.

We will learn to sort arrays in natural ordering, reverse ordering and any other custom ordering as well.

1. Basics of Array Sorting

The basic concepts behind the sorting feature remain the same no matter which Java API we use to sort.

• All inbuilt APIs support the sorting with the natural order by default. Numerical types are sorted in ascending order, strings are sorted in dictionary order (lexicographically) and custom objects are sorted by the order implemented by the Comparable interface.
• To sort in the reverse order, we can use Comparator.reverseOrder() to the sort methods.
• To sort in the custom order, we must create an instance of the Comparator interface and provide the relevant sorting behavior in it. Then we will pass an instance of the comparator into the sort API.

Now let’s dive into the java programs demonstrating the sorting of arrays. For custom sorting, we will use the instances of User class. Note that the default sorting is supported on the id field.

public class User implements Comparable  < public long id; public String firstName; public String lastName; //Add getters and setters @Override public int compareTo(final User user) < if(user == null ) < return -1; >else < return (int)(this.id - user.id); >> >

2. Arrays.sort() and Arrays.parallelSort()

The java.util.Arrays class provides many utilities static methods. The sort() APis are also such methods that helps in sorting a given array of items.

The sort() API implementation is a stable, adaptive, iterative mergesort that requires far fewer than n lg(n) comparisons when the input array is partially sorted. It offers the performance of a traditional mergesort when the input array is randomly ordered. If the input array is nearly sorted, the implementation requires approximately n comparisons.

The parallelSort() API implementation is a Dual-Pivot quicksort that offers O(n log(n)) performance on all data sets, and is typically faster than traditional (one-pivot) quicksort implementations.

public static void sort(array, ?comparator) public static void parallelSort(array, ?comparator)

2.1. Sorting in Natural Order

Java program to sort a String array in default order. Note that String class has implemented the Comparable interface, already.

String[] tokens = ; Arrays.sort(tokens); //[A, B, C, D, E]

2.2. Sorting in Reverse Order

Java program to use the Comparator.reverseOrder() to reverse the natural ordering.

String[] tokens = ; Arrays.sort(tokens, Collections.reverseOrder()); //[E, D, C, B, A]

We are sorting the users array by their first name.

User[] users = getUsersArray(); Comparator firstNameSorter = Comparator.comparing(User::getFirstName); Arrays.sort(users, firstNameSorter);

To sort on multiple fields, like SQL group by clause, we can create a complex Comparator instance and use it for sorting purposes.

Comparator fullNameSorter = Comparator.comparing(Employee::getFirstName) .thenComparing(Employee::getLastName); Arrays.sort(employees, fullNameSorter);

3. Sorting Arrays using Stream API

We can sort the array of primitives or custom objects using the Stream.sorted() method in a very similar way we used the Arrays.sort() API.

• The sorted() API returns a stream consisting of the elements of this stream, sorted according to the natural order.
• If the elements of this stream are not Comparable , a java.lang.ClassCastException may be thrown when the terminal operation is executed.
• It also accepts an optional comparator instance that is used for implementing the custom sorting behavior.

For ordered streams (stream is generated from an ordered collection such as ArrayList), the sort is stable. For unordered streams (for example, streams generated from HashMap), no stability guarantees are made.

Stream sorted() Stream sorted(?comparator)

//1. Natural ordering User[] sortedUserArray = Stream.of(userArray) .sorted() .toArray(User[]::new); //2. Reverse ordering User[] sortedUserArray = Stream.of(userArray) .sorted(Comparator.reverseOrder()) .toArray(User[]::new); //3. Custom Sorting Comparator nameComparator = Comparator.comparing(Employee::getName) .thenComparing(Employee::getId) User[] sortedUserArray = Stream.of(userArray) .sorted(nameComparator) .toArray(User[]::new);

In this given example, we learned to sort an array using Arrays.sort() and Stream APIs. We learned to sort in natural order, reverse order as well as in custom order.

Источник

How to Sort an Array, List, Map or Stream in Java

Learn to sort a Java Set , List and Map of primitive types and custom objects using Comparator, Comparable and new lambda expressions. We will learn to sort in ascending and descending order as well.

//Sorting an array Arrays.sort( arrayOfItems ); Arrays.sort( arrayOfItems, Collections.reverseOrder() ); Arrays.sort(arrayOfItems, 2, 6); Arrays.parallelSort(arrayOfItems); //Sorting a List Collections.sort(numbersList); Collections.sort(numbersList, Collections.reverseOrder()); //Sorting a Set Set to List -> Sort -> List to Set Collections.sort(numbersList); //Sorting a Map TreeMap treeMap = new TreeMap<>(map); unsortedeMap.entrySet() .stream() .sorted(Map.Entry.comparingByValue()) .forEachOrdered(x -> sortedMap.put(x.getKey(), x.getValue())); //Java 8 Lambda Comparator nameSorter = (a, b) -> a.getName().compareToIgnoreCase(b.getName()); Collections.sort(list, nameSorter); Collections.sort(list, Comparator.comparing(Employee::getName)); //Group By Sorting Collections.sort(list, Comparator .comparing(Employee::getName) .thenComparing(Employee::getDob));

1. Sorting a List of Objects

To sort a list of objects, we have two popular approaches i.e. Comparable and Comparator interfaces. In the upcoming examples, we will sort a collection of Employee objects in different ways.

public class Employee implements Comparable

Comparable interface enables the natural ordering of the classes that implements it. This makes the classes comparable to its other instances.

A class implementing Comparable interface must override compareTo() method in which it can specify the comparison logic between two instances of the same class.

• Lists (and arrays) of objects that implement Comparable interface can be sorted automatically by Collections.sort() and Arrays.sort() APIs.
• Objects that implement this interface will be automatically sorted when put in a sorted map (as keys) or sorted set (as elements).
• It is strongly recommended (though not required) that natural orderings be consistent with equals() method. Virtually all Java core classes that implement Comparable have natural orderings that are consistent with equals() .

ArrayList list = new ArrayList<>(); //add employees.. Collections.sort(list);

To sort the list in reversed order, the best way is to use the Comparator.reversed() API that imposes the reverse ordering.

ArrayList list = new ArrayList<>(); //add employees.. Collections.sort(list, Comparator.reversed());

When not seeking the natural ordering, we can take the help of Comparator interface to apply custom sorting behavior.

Comparator does not require modifying the source code of the class. We can create the comparison logic in a separate class which implements Comparator interface and override its compare() method.

During sorting, we pass an instance of this comparator to sort() method along with the list of custom objects.

For example, we want to sort the list of employees by their first name, while the natural sorting has been implemented by id field. So, to sort on name field, we must write the custom sorting logic using Comparator interface.

import java.util.Comparator; public class NameSorter implements Comparator<Employee> < @Override public int compare(Employee e1, Employee e2) < return e1.getName().compareToIgnoreCase( e2.getName() ); >>

Notice the use of NameSorter in sort() method as the second argument in the given example.

ArrayList list = new ArrayList<>(); //add employees to list Collections.sort(list, new NameSorter());

To do the reverse sorting, we just need to call the reversed() method on the Comparator instance.

ArrayList list = new ArrayList<>(); //add employees to list Collections.sort(list, new NameSorter().reversed());

1.3. Sorting with Lambda Expressions

Lambda expressions help in writing Comparator implementations on the fly. We do not need to create a separate class to provide the one-time comparison logic.

Comparator nameSorter = (a, b) -> a.getName().compareToIgnoreCase(b.getName()); Collections.sort(list, nameSorter);

To apply SQL style sorting on a collection of objects on different fields (group by sort), we can use multiple comparators in a chain. This chaining of comparators can be created using Comparator.comparing() and Comparator.thenComparing() methods.

For example, we can sort the list of employees by name and then sort again by their age.

ArrayList list = new ArrayList<>(); //add employees to list Collections.sort(list, Comparator .comparing(Employee::getName) .thenComparing(Employee::getDob));

Use java.util.Arrays.sort() method to sort a given array in a variety of ways. The sort() is an overloaded method that takes all sorts of types as the method argument.

This method implements a Dual-Pivot Quicksort sorting algorithm that offers O(n log(n)) performance on all data sets and is typically faster than traditional (one-pivot) Quicksort implementations.

Java program to sort an array of integers in ascending order using Arrays.sort() method.

//Unsorted array Integer[] numbers = new Integer[] < 15, 11, . >; //Sort the array Arrays.sort(numbers);

Java provides Collections.reverseOrder() comparator to reverse the default sorting behavior in one line. We can use this comparator to sort the array in descending order.

Note that all elements in the array must be mutually comparable by the specified comparator.

//Unsorted array Integer[] numbers = new Integer[] < 15, 11, . >; //Sort the array in reverse order Arrays.sort(numbers, Collections.reverseOrder());

Arrays.sort() method is an overloaded method and takes two additional parameters i.e. fromIndex (inclusive) and toIndex (exclusive).

When provided above arguments, the array will be sorted within the provided range from position fromIndex to position toIndex .

Given below is an example to sort the array from element 9 to 18. i.e. will be sorted and the rest elements will not be touched.

//Unsorted array Integer[] numbers = new Integer[] < 15, 11, 9, 55, 47, 18, 1123, 520, 366, 420 >; //Sort the array Arrays.sort(numbers, 2, 6); //Print array to confirm System.out.println(Arrays.toString(numbers));

[15, 11, 9, 18, 47, 55, 1123, 520, 366, 420]

Java 8 introduced lots of new APIs for parallel processing data sets and streams. One such API is Arrays.parallelSort() .

The parallelSort() method breaks the array into multiple sub-arrays and each sub-array is sorted with Arrays.sort() in different threads. Finally, all sorted sub-arrays are merged into one sorted array.

The output of the parallelSort() and sort() , both APIs, will be same at last. It’s just a matter of leveraging the Java concurrency.

 
//Parallel sort complete array Arrays.parallelSort(numbers); //Parallel sort array range Arrays.parallelSort(numbers, 2, 6); //Parallel sort array in reverse order Arrays.parallelSort(numbers, Collections.reverseOrder());
 
There is no direct support for sorting the Set in Java. To sort a Set , follow these steps:
 
 
Convert Set to List .
 
Sort List using Collections.sort() API.
 
Convert List back to Set .
 
 
//Unsorted set HashSet numbersSet = new LinkedHashSet<>(); //with Set items List numbersList = new ArrayList(numbersSet) ; //set -> list //Sort the list Collections.sort(numbersList); //sorted set numbersSet = new LinkedHashSet<>(numbersList); //list -> set
 
A Map is the collection of key-value pairs. So logically, we can sort the maps in two ways i.e. sort by key or sort by value.
 
The best and most effective a sort a map by keys is to add all map entries in TreeMap object. TreeMap stores the keys in sorted order, always.
 
HashMap map = new HashMap<>(); //Unsorted Map TreeMap treeMap = new TreeMap<>(map); //Sorted by map keys
 
In Java 8, Map.Entry class has static method comparingByValue() to help us in sorting the Map by values.
 
The comparingByValue() method returns a Comparator that compares Map.Entry in natural order on values.
 
HashMap unSortedMap = new HashMap<>(); //Unsorted Map //LinkedHashMap preserve the ordering of elements in which they are inserted LinkedHashMap sortedMap = new LinkedHashMap<>(); unSortedMap.entrySet() .stream() .sorted(Map.Entry.comparingByValue()) .forEachOrdered(x -> sortedMap.put(x.getKey(), x.getValue()));
 
In the above-given examples, we learned to sort an Array, List, Map, and Set.
 
We saw different ways to initialize and use Comparator interface including lambda expressions. We also learned to effectively use the Comparator interface.
 
Источник