What is sorting?

In Java, "ordering" often refers to the process of arranging collection elements in a specific order. There are two main mechanisms for this:

Natural Ordering: A class implements the Comparable interface, defining the compareTo() method. This method compares the current object with another object of the same type and returns a negative integer, zero, or a positive integer if the current object is "less than," "equal to," or "greater than" the other object, respectively. Many standard classes, such as String, Integer, Double, already implement Comparable.
```
// Example of natural ordering for strings
String s1 = "apple";
String s2 = "banana";
int result = s1.compareTo(s2); // result will be negative

Integer i1 = 10;
Integer i2 = 5;
int result2 = i1.compareTo(i2); // result2 will be positive
```

Custom Ordering: A separate class is created that implements the Comparator interface, defining the compare(T o1, T o2) method. This method compares two objects and returns a negative integer, zero, or a positive integer similar to compareTo(). Comparator is used when natural ordering is not suitable or if multiple ordering methods are needed for a single type.

import java.util.Comparator;

// Example of custom ordering by string length
public class StringLengthComparator implements Comparator<String> {
    @Override
    public int compare(String s1, String s2) {
        return Integer.compare(s1.length(), s2.length());
    }
}

// Using the comparator
// List<String> strings = Arrays.asList("orange", "apple", "grape");
// Collections.sort(strings, new StringLengthComparator());
// Now, the list will be ["apple", "grape", "orange"]

These mechanisms are used by sorting methods in classes like Arrays and Collections, as well as in sorted collections such as TreeSet and TreeMap.