Sorting in Java
Whenever we do hear sorting algorithms come into play such as selection sort, bubble sort, insertion sort, radix sort, bucket sort, etc but if we look closer here we are not asked to use any kind of algorithms. It is as simple sorting with the help of linear and non-linear data structures present within java. So there is sorting done with the help of brute force in java with the help of loops and there are two in-built methods to sort in Java.
Ways of sorting in Java
- Using loops
- Using sort() method of Arrays class
- Using sort method of Collections class
- Sorting on a subarray
Let us discuss all four of them and propose a code for each one of them.
Way 1: Using loops
1 2 3 4
Way 2: Using sort() method of Arrays class
Arrays.Sort() works for arrays which can be of primitive data type also which in turn by default sorts in ascending order.
Modified arr : [6, 7, 9, 13, 21, 45, 101, 102]
Modified arr : [100, 45, 21, 13, 9, 7, 6, 2]
Way 3: Using sort() method of Collections class
Collections.sort() works for objects Collections like ArrayList and LinkedList.
List after the use of Collection.sort() : [Dear, Friends, Geeks For Geeks, Is, Superb]
List after the use of Collection.sort() : [Superb, Is, Geeks For Geeks, Friends, Dear]
Way 4: Sorting only a subarray
Modified arr : [13, 6, 7, 21, 45, 9, 2, 100]
- Which sorting algorithm does Java use in sort()?
Previously, Java’s Arrays.sort method used Quicksort for arrays of primitives and Merge sort for arrays of objects. In the latest versions of Java, Arrays.sort method and Collection.sort() uses Timsort.
- Which order of sorting is done by default?
It by default sorts in ascending order.
- How to sort array or list in descending order?
It can be done with the help of Collections.reverseOrder().
- How to write my own sorting function in Java?
Please see Java programs for Quick Sort, Merge Sort, Insertion Sort, Selection Sort, Heap Sort, Bubble Sort