February 2014
Beginner
1248 pages
62h 25m
English
• Algorithms sort (p. 697), binarySearch, reverse (p. 702), shuffle (p. 700), fill (p. 702), copy, addAll (p. 693), frequency and disjoint operate on Lists. Algorithms min and max (p. 703) operate on Collections.
• Algorithm addAll appends all the elements in an array to a collection (p. 706), frequency (p. 706) calculates how many elements in the collection are equal to the specified element, and disjoint (p. 706) determines whether two collections have elements in common.
• Algorithms min and max find the smallest and largest items in a collection.
• The Comparator interface (p. 697) provides a means of sorting a Collection’s elements in an order other than their natural order.
• Collections method reverseOrder ...
Read now
Unlock full access