/*
// Lame try #1, using insertion sort
#include "insertionSort.h"
template <typename Iterator>
void sort5(Iterator& b) { insertionSort(b, b+5); }

// Lame try #2, using randomized quickSort
#include "quickSort.h"
template <typename Iterator>
void sort5(Iterator b) { quickSort(b, b+5, true); }
*/

// Lame try #3, using heapSort
#include "heapSort.h"
template <typename Iterator>
void sort5(Iterator b) { heapSort(b, b+5); }

/*
// The real deal, my special sorter for 5 elements
template <typename Iterator>
void sort5(Iterator b) 
{ 
  if (b[0] < b[1])
  {
    //...
  }
  else
  {
    //...
  }
}
*/