[ Home ] [ Up ] [ Comparable Interface ] [ Comparator Interface ] [ Collections Class ] [ Comparable Example ] [ Comparator Example ] [ General Applicability ]

I could add a number of examples, using other algorithms such as:

• binarySearch
• reverse
• shuffle
• fill
• copy
• min
• max
• etc.

but the main point of this collections framework is consistency:

If you know how to call one algorithm, you know how to use them all;  only minor changes have to be made.

This makes learning the framework a breeze, once you've learned the basics!

This page was last modified on 02 October, 2007