How do you sort an array in reverse order?

The only way to sort a primitive array in descending order is, first sort the array in ascending order and then reverse the array in place. This is also true for two-dimensional primitive arrays. You can use this: Arrays.Click to see full answer. Consequently, how do you sort an array in descending order?The only way to sort a primitive array in descending order is first to sort it in ascending order and then reverse the array in place as shown on the link. Since in-place reversal is an efficient algorithm and doesn’t require extra memory, you can use it sort and reverse large array as well.Additionally, how do you sort a list in reverse order? sort(arraylist, Collections. reverseOrder()); However the reverse order sorting can also be done as following – This way the list will be sorted in ascending order first and then it will be reversed. In the above example we have used the ArrayList of String type ( ArrayList ) for sorting. Then, how do you sort an array in reverse order in C++? To sort an array in reverse/decreasing order, you can use std::sort algorithm provided by STL. It sorts the elements of a container in the range pointed by the specified iterators using a comparator. The default comparator used is std::less which sorts the container in ascending order using operator.How do you sort an array? Take a look at this example: import java. util. Arrays; public class Sorting { public static void main (String [] args) { int [] array = {45,12,85,32,89,39,69,44,42,1,6,8}; Arrays. sort(array); System. out. println(“Completely Sorted: ” + Arrays. int index = Arrays. binarySearch(array, 42); System. out.