Sorting an array is i of the mutual tasks inward Programming in addition to you lot receive got many algorithms to kind an array similar QuickSort, MergeSort which provides O(NLogN) time functioning in addition to Bucket Sort, Counting Sort and Radix Sort algorithms which tin fifty-fifty kind unopen to array inward O(N) time. But, you lot hardly demand to code these algorithms past times manus when it comes to writing existent code. The Programming linguistic communication you lot volition operate already receive got tried in addition to tested implementation for those algorithms in addition to that's what you lot volition acquire inward this article. In Java Programming language, it's slow to kind an array, you lot merely demand to telephone squall upward the Arrays.sort() method alongside a Comparator which tin kind the array inward the fellowship you lot desire but it highly depends upon which type of object is stored inward the array.
For example, you lot tin kind an object array inward decreasing or opposite order, merely provide a Comparator alongside the opposite order. You tin fifty-fifty operate Collections.reverseOrder() if you lot desire to kind an array inward the decreasing order, which returns a opposite Comparator to kind objects inward the fellowship opposite of their natural ordering defined past times the compareTo() method.
Unfortunately, for a primitive array, in that location is no straight means to kind inward descending order. The Arrays.sort() method which is used to kind a primitive array inward Java doesn't receive got a boolean to kind the primitive array inward opposite order.
You mightiness receive got seen the error "no suitable method institute for sort(int[],comparator<object>)" which occurs when programmers endeavor to telephone squall upward the Arrays.sort() method past times passing opposite Comparator defined bythe Collection.reverseOrder() method.
That volition piece of occupation fine alongside Integer array but volition non piece of occupation alongside an int array. The entirely means to kind a primitive array inward descending fellowship is commencement sorted the array inward ascending fellowship in addition to and thence opposite the array inward house every bit shown here. This is too truthful for two-dimensional primitive arrays.
Btw, if you lot are novel into Java Programming in addition to non familiar alongside mutual Java API in addition to classes similar Comparator, Arrays, in addition to Integer in addition to thence I propose you lot to commencement acquire through a comprehensive course of written report like The Complete Java Masterclass on Udemy which volition learn you lot all these in addition to much to a greater extent than inward quick time. It's too the most up-to-date course of written report inward Java.
Fortunately, you lot don't demand to code it yourself, you lot tin operate Collections.reverseOrder(Comparator comp) to acquire a opposite fellowship Comparator. Just locomote past times your Comparator to this method in addition to it volition render the opposite fellowship Comparator.
If you lot are using a Comparator method to kind inward the natural order, you lot tin too operate the overloaded Collection.reverseOrder() method. It returns a Comparator which sorts inward the opposite of natural order. In fact, this is the i you lot volition live using most of the time.
Here is an event of sorting Integer array inward descending order:
Now the cubes array volition live {256, 125, 64, 27,8}, you tin run into the fellowship is reversed in addition to elements are sorted inward decreasing order.
Sometimes, you lot operate your ain customized Comparator similar a comparator nosotros receive got used to kind Employee past times their salary. If you lot are using that i in addition to thence you lot demand to telephone squall upward the Array.sort() method every bit follows
where SALARY_CPM is the Comparator which orders employee past times their salary. You tin run into the descending order. As I told before, in that location are no Arrays.sort() method which tin kind the array inward the opposite order. Many programmers brand the error of calling the to a higher house Array.sort() method every bit follows:
This is a compile-time error "The method sort(int[]) inward the type Arrays is non applicable for the arguments (int[], Comparator<Object>)" because in that location is no such method inward the java.util.Arrays class.
The entirely means to kind a primitive array inward descending fellowship is commencement to kind it inward ascending fellowship in addition to and thence reverse the array inward place every bit shown on the link.
Since in-place reversal is an efficient algorithm in addition to doesn't require extra memory, you lot tin operate it kind in addition to opposite large array every bit well.
You tin too run into a comprehensive course of written report on information construction in addition to algorithms like Data Structures in addition to Algorithms: Deep Dive Using Java to acquire to a greater extent than close efficient sorting algorithm similar O(n) sorting algorithm similar Bucket kind in addition to Counting Sort inward Java.
The entirely means to reach that is commencement past times sorting the array inward increasing order in addition to and thence reverse the array inward place in addition to that what I receive got done inward this example.
I receive got used Arrays.sort() method to kind a primitive array inward ascending fellowship in addition to and thence written a reverse() method to opposite the array inward place.
Since in that location are viii primitive types inward Java, you lot demand to write split opposite methods to opposite a byte array, long array or a float array.
That's all close how to kind an array inward descending fellowship inward Java. You tin operate a opposite Comparator or Collections.reverseOrder() method to kind an object array inward descending fellowship e.g. String array, Integer array or Double array.
The Arrays.sort() method is overloaded to receive got a Comparator, which tin too live a opposite Comparator. Now, to kind a primitive array inward decreasing order, in that location is no straight way.
You commencement demand to kind it on ascending or normal fellowship in addition to and thence opposite the array inward place. The in-place algorithm is an efficient means to opposite array in addition to doesn't require extra memory, thence it tin too live used to opposite a large array.
Further Learning
The Complete Java Masterclass
Data Structures in addition to Algorithms: Deep Dive Using Java
solution)How to convert an array to String inward Java? (solution) My favorite costless courses to acquire information Structure inward depth (FreeCodeCamp) How to attempt if an array contains a value inward Java? (solution) 22 Array concepts Interview Questions inward Java? (answer) How to impress elements of an array inward Java? (example) 100+ Data Structure Coding Problems from Interviews (questions) What is the deviation betwixt array in addition to ArrayList inward Java? (answer) How to loop over an array inward Java? (solution) How to uncovering duplicate elements inward Java array? (answer) How to take duplicate objects from an array inward Java? (answer) 50+ Data Structure in addition to Algorithms Problems from Interviews (questions) Iterative PreOrder traversal inward a binary tree (solution) How to count the expose of leafage nodes inward a given binary tree inward Java? (solution) 10 Free Data Structure in addition to Algorithm Courses for Programmers (courses) 10 Free Courses to Learn Java Programming (courses) Thanks for reading this article thence far. If you lot similar this Java Array tutorial in addition to thence delight part alongside your friends in addition to colleagues. If you lot receive got whatsoever questions or feedback in addition to thence delight drib a comment.
P. S. - If you lot are looking for unopen to Free Algorithms courses to amend your agreement of Data Structure in addition to Algorithms, in addition to thence you lot should too banking firm jibe the Easy to Advanced Data Structures course of written report on Udemy. It's authored past times a Google Software Engineer in addition to Algorithm practiced in addition to its completely costless of cost.
For example, you lot tin kind an object array inward decreasing or opposite order, merely provide a Comparator alongside the opposite order. You tin fifty-fifty operate Collections.reverseOrder() if you lot desire to kind an array inward the decreasing order, which returns a opposite Comparator to kind objects inward the fellowship opposite of their natural ordering defined past times the compareTo() method.
Unfortunately, for a primitive array, in that location is no straight means to kind inward descending order. The Arrays.sort() method which is used to kind a primitive array inward Java doesn't receive got a boolean to kind the primitive array inward opposite order.
You mightiness receive got seen the error "no suitable method institute for sort(int[],comparator<object>)" which occurs when programmers endeavor to telephone squall upward the Arrays.sort() method past times passing opposite Comparator defined bythe Collection.reverseOrder() method.
That volition piece of occupation fine alongside Integer array but volition non piece of occupation alongside an int array. The entirely means to kind a primitive array inward descending fellowship is commencement sorted the array inward ascending fellowship in addition to and thence opposite the array inward house every bit shown here. This is too truthful for two-dimensional primitive arrays.
Btw, if you lot are novel into Java Programming in addition to non familiar alongside mutual Java API in addition to classes similar Comparator, Arrays, in addition to Integer in addition to thence I propose you lot to commencement acquire through a comprehensive course of written report like The Complete Java Masterclass on Udemy which volition learn you lot all these in addition to much to a greater extent than inward quick time. It's too the most up-to-date course of written report inward Java.
How to kind Object Array inward Descending Order
First, let's run into the event of sorting an object array into ascending order. Then we'll run into how to kind a primitive array inward descending order. In fellowship to kind a reference type array similar String array, Integer array or Employee array, you lot demand to locomote past times the Array.sort() method a reverse Comparator.Fortunately, you lot don't demand to code it yourself, you lot tin operate Collections.reverseOrder(Comparator comp) to acquire a opposite fellowship Comparator. Just locomote past times your Comparator to this method in addition to it volition render the opposite fellowship Comparator.
If you lot are using a Comparator method to kind inward the natural order, you lot tin too operate the overloaded Collection.reverseOrder() method. It returns a Comparator which sorts inward the opposite of natural order. In fact, this is the i you lot volition live using most of the time.
Here is an event of sorting Integer array inward descending order:
Integer[] cubes = new Integer[] { 8, 27, 64, 125, 256 }; Arrays.sort(cubes, Collections.reverseOrder());
Now the cubes array volition live {256, 125, 64, 27,8}, you tin run into the fellowship is reversed in addition to elements are sorted inward decreasing order.
Sometimes, you lot operate your ain customized Comparator similar a comparator nosotros receive got used to kind Employee past times their salary. If you lot are using that i in addition to thence you lot demand to telephone squall upward the Array.sort() method every bit follows
Arrays.sort(emp[], Collections.sort(SALARY_CMP));
where SALARY_CPM is the Comparator which orders employee past times their salary. You tin run into the descending order. As I told before, in that location are no Arrays.sort() method which tin kind the array inward the opposite order. Many programmers brand the error of calling the to a higher house Array.sort() method every bit follows:
int[] squares = { 4, 25, 9, 36, 49 }; Arrays.sort(squares, Collections.reverseOrder());
This is a compile-time error "The method sort(int[]) inward the type Arrays is non applicable for the arguments (int[], Comparator<Object>)" because in that location is no such method inward the java.util.Arrays class.
The entirely means to kind a primitive array inward descending fellowship is commencement to kind it inward ascending fellowship in addition to and thence reverse the array inward place every bit shown on the link.
Since in-place reversal is an efficient algorithm in addition to doesn't require extra memory, you lot tin operate it kind in addition to opposite large array every bit well.
You tin too run into a comprehensive course of written report on information construction in addition to algorithms like Data Structures in addition to Algorithms: Deep Dive Using Java to acquire to a greater extent than close efficient sorting algorithm similar O(n) sorting algorithm similar Bucket kind in addition to Counting Sort inward Java.
Java Program to Sort an Array inward Decreasing Order
Here is a consummate Java programme to kind an object array in addition to a primitive array inward the opposite fellowship inward Java. As I told it's slow to kind a reference array to decreasing fellowship because you lot tin provide a opposite Comparator past times using Collections.reverseOrder() method, but it's tricky to kind the primitive array inward opposite order.The entirely means to reach that is commencement past times sorting the array inward increasing order in addition to and thence reverse the array inward place in addition to that what I receive got done inward this example.
I receive got used Arrays.sort() method to kind a primitive array inward ascending fellowship in addition to and thence written a reverse() method to opposite the array inward place.
Since in that location are viii primitive types inward Java, you lot demand to write split opposite methods to opposite a byte array, long array or a float array.
import java.util.Arrays; import java.util.Collections; /* * Java Program to kind the array inward descending order. * Object array tin live sorted inward opposite fellowship past times using * Array.sort(array, Comparator) method but primitive * array e.g. int[] or char[] tin entirely live sorted * inward ascending order. For opposite order, merely * opposite the array. * */ public class ArraySorter { public static void main(String[] args) { // sorting Integer array inward descending order Integer[] cubes = new Integer[] { 8, 27, 64, 125, 256 }; System.out.println("Integer array earlier sorting : " + Arrays.toString(cubes)); System.out.println("sorting array inward descending order"); Arrays.sort(cubes, Collections.reverseOrder()); System.out.println("array afterward sorted inward opposite order: " + Arrays.toString(cubes)); // sorting primitive array int[] inward descending order int[] squares = { 4, 25, 9, 36, 49 }; System.out.println("int[] array earlier sorting : " + Arrays.toString(squares)); System.out.println("sorting array inward ascending order"); Arrays.sort(squares, Collections.reverseOrder()); System.out.println("reversing array inward place"); reverse(squares); System.out.println("Sorted array inward descending fellowship : " + Arrays.toString(squares)); } /** * opposite given array inward house * * @param input */ public static void reverse(int[] input) { int last = input.length - 1; int middle = input.length / 2; for (int i = 0; i <= middle; i++) { int temp = input[i]; input[i] = input[last - i]; input[last - i] = temp; } } } Output Integer array earlier sorting : [8, 27, 64, 125, 256] sorting array in descending fellowship array afterward sorted in reverse order: [256, 125, 64, 27, 8] int[] array earlier sorting : [4, 25, 9, 36, 49] sorting an array in ascending fellowship reversing array in house Sorted array in descending fellowship : [49, 36, 25, 9, 4]
That's all close how to kind an array inward descending fellowship inward Java. You tin operate a opposite Comparator or Collections.reverseOrder() method to kind an object array inward descending fellowship e.g. String array, Integer array or Double array.
The Arrays.sort() method is overloaded to receive got a Comparator, which tin too live a opposite Comparator. Now, to kind a primitive array inward decreasing order, in that location is no straight way.
You commencement demand to kind it on ascending or normal fellowship in addition to and thence opposite the array inward place. The in-place algorithm is an efficient means to opposite array in addition to doesn't require extra memory, thence it tin too live used to opposite a large array.
Further Learning
The Complete Java Masterclass
Data Structures in addition to Algorithms: Deep Dive Using Java
solution)
P. S. - If you lot are looking for unopen to Free Algorithms courses to amend your agreement of Data Structure in addition to Algorithms, in addition to thence you lot should too banking firm jibe the Easy to Advanced Data Structures course of written report on Udemy. It's authored past times a Google Software Engineer in addition to Algorithm practiced in addition to its completely costless of cost.
