Parameterize a sorting routine by the operation it uses to compare elements?

From Design Patterns by Gang of Four

Parameterized types give us a third way (in addition to class inheritance and object composition) to compose behavior in object-oriented systems. Many designs can be implemented using any of these three techniques. To parameterize a sorting routine by the operation it uses to compare elements, we could make the comparison

1. an operation implemented by subclasses (an application of Template Method (325)),
2. the responsibility of an object that's passed to the sorting routine (Strategy (315)), or
3. an argument of a C++ template or Ada generic that specifies the name of the function to call to compare the elements.

How are the three ways used to parameterize a sorting routine by the operation it uses to compare elements? Could you give some examples?

Thanks.