The collections framework : Algorithms sort(List) - Sorts a list using a merge sort algorithm, which provides average-case performance comparable to a high-quality quicksort, guaranteed O(n*log n) performance (unlike quicksort), and stability (unlike quicksort). (A stable sort is one that does not reorder equal elements.) binarySearch(List, Object) - Searches for an element in an ordered list using the binary search algorithm. reverse(List) - Reverses the order of the elements in the a list. shuffle(List) - Randomly permutes the elements in a list. fill(List, Object) - Overwrites every element in a list with the specified value. copy(List dest, List src) - Copies the source list into the destination list. min(Collection) - Returns the minimum element in a collection. max(Collection) - Returns the maximum element in a collection.