InsertByWhateverOrder.java

/**
 * Insert a new {@link Whatever} instance in ascent/descent order.
 */
public void insertByWhateverOrder(List<Whatever> whatevers, Whatever one) {
    // The complexity is O(nlog(n)). The list needs to be already sorted in
    // natural sorting order. Searching in an unsorted array has an undefined
    // result.
    int position = Collections.binarySearch(whatevers, one);
    if (position < 0) {
        whatevers.add(-position - 1, one);
    } else {
        whatevers.add(position, one);
    }
}