Simple implementation of Bubble Sort algorithm

BubbleSort.cpp

// Random Generator
template <typename Comparable>
void fillRandom(vector<Comparable> &iArray)
{
 srand((unsigned)time(0));
 for(vector<Comparable>::size_type i = 0; i < iArray.size(); i++)
 {
  iArray[i] = rand();
 }
}

// Bubble Sort algorithm
template <typename Comparable>
void bubbleSort(vector<Comparable> &a)
{
 bool sorted = false;
 for(int pass = 1; pass < a.size() && !sorted; pass++)
 {
  sorted = true; // Optimize and stop if array is already sorted
  for(int index = 0; index < a.size() - pass; index++)
  {
   if(a[index] > a[index + 1])
   {
    swap(a[index], a[index + 1]);
    sorted = false;
   }
  }
 }
}

// Bubble Sort algorithm, inverted version
template <typename Comparable>
void bubbleSortInverted(vector<Comparable> &a)
{
 bool sorted = false;
 for(int pass = a.size() - 1; pass > 0 && !sorted; pass--)
 {
  sorted = true; // Optimize and stop if array is already sorted
  for(int index = a.size() - 1; index > 0; index--)
  {
   if(a[index] < a[index - 1])
   {
    swap(a[index], a[index - 1]);
    sorted = false;
   }
  }
 }
}