+-------------------------------------+---------------------------------------------------+
|                                     |                                                   |
| MAX(A, N)                           | CLOSEST_PAIR(P,N)                                 |
| index=0;                            | ind1 = 0;                                         |
| for (i=1; i<N; ++i) {               | ind2 = 1;                                         |
|     if ( A[i]>A[index] ) index = i; | min_dist = +infinity;                             |
| }                                   |    for (i=0; i<N-1; ++i) {                        |
| return index;                       |        for (j=i+1; j<N; ++j) {                    |
|                                     |            if ( dist( P[i], P[j] ) < min_dist ) { |
|                                     |                ind1 = i;                          |
|                                     |                ind2 = j;                          |
|                                     |                min_dist = dist( P[i], P[j] )      |
|                                     |            }                                      |
|                                     |        }                                          |
|                                     | }                                                 |
|                                     | return std::make_tuple( ind1, ind2 );             |
+-------------------------------------+---------------------------------------------------+
|                                     |                                                   |
| SEARCH(A, N, Val)                   | SORT(A, N)                                        |
| for (i=1; i<N; ++i) {               | foreach p in permutations {                       |
|     if ( A[i] == Val ) return i;    |  if ( p(a) is sorted ) {                          |
| }                                   |         return p(a)                               |
| return -1; // not found             |     }                                             |
|                                     | }                                                 |
|                                     | return -1; // ??                                  |
|                                     |                                                   |
+-------------------------------------+---------------------------------------------------+