# Generic Algorithms

## Iterable<E>, for each loop

Each collection class supporting the creation of iterators implements the Iterable<E> interface. This interface defines a single method:

The for each loop is a special kind of loop for traversing the elements of a collection. Example:

The loop above is exactly equivalent to the following:

In other words, using a for each loop on an Iterable collection creates an iterator to do the traversal. Any object belonging to a class implementing the Iterable<E> interface can be used in a for each loop.

Note that you can also use the for each loop with an ordinary array:

## Generic Algorithms

A generic algorithm is one that can work with many possible data structures and many possible kinds of data.

For example, we have already seen (in Chapter 9 how to write a generic bubbleSort method to sort the elements of an array with any element type (as long as the element type implements the Comparable interface).

### Pre-built generic algorithms

The java.util.Collections class has implementations of a number of generic algorithms.

Some examples:

• static<T extends Comparable<T>> void sort(List<T> list) - sort the elements of a List
• static<T> void sort(List<T> list, Comparator<T> comp) - sort the elements of a List using a specified Comparator
• static<T> void reverse(List<T> list) - reverse the elements of a List
• static<T extends Comparable<T>> T max(Collection<T> c) - returns the maximum value in a collection
• static<T> T max(Collection<T> c, Comparator<T> comp) - returns the maximum value in a collection, using the given Comparator to compare element values
• static<T> shuffle(List<T> list) - randomly shuffle the elements of the given List.

The java.util.Arrays class contains a number of implementations of generic algorithms which operate on arrays instead of collection objects.

## Implementing Generic Algorithms

Writing methods that implement generic algorithms is fairly easy. There are a few general principles to keep in mind.

Make them static. To make an implementation of a generic algorithm applicable to any kind of data structure, it shouldn’t be an instance method of any specific class. So, make it a static method of a class. The class doesn’t really serve any purpose other than to provide a home for the static method.

The algorithm should take one or more Collections, Lists, or Sets as parameter(s). A generic algorithm typically operates on some collection of values, so taking a reference to a collection object is a general way for the implementation of the algorithm to accept its input. Try to choose the most general interface possible: if you can implement the algorithm for any Collection (and not just Lists or Sets), so much the better. Avoid requiring an instance of any concrete collection class (e.g., ArrayList) as a parameter.

Use functors such as Iterators and Comparators. If you need to traverse the elements of a collection, use an Iterator. If you need to compare element values, use a Comparator. If it makes sense, allow the algorithm to take a reference to an instance of a functor object, as we did with bubbleSort (by allowing it to use a Comparator passed as a parameter.) Functors allow maximum flexibility by allowing details of how the algorithm is to be executed to vary according to which functor implementation is used.