April 05
Prde. Ismael H. F. Santos -  ismael@tecgraf.puc-rio.br                                                          2
Algoritmos com List
1.sort — sorts a List using a merge sort algorithm, which provides a fast, stable sort. (A stable sort is one that does not reorder equal elements.)
2.shuffle — randomly permutes the elements in a List.
3.reverse — reverses the order of the elements in a List.
4.rotate — rotates all the elements in a List by a specified distance.
5.swap — swaps the elements at specified positions in a List.
6.replaceAll — replaces all occurrences of one specified value with another.
7.fill — overwrites every element in a List with the specified value.
8.copy — copies the source List into the destination List.
9.binarySearch — searches for an element in an ordered List using the binary search algorithm.
10.indexOfSubList — returns the index of the first sublist of one List that is equal to another.
11.lastIndexOfSubList — returns the index of the last sublist of one List that is equal to another.