for (i=0; i<n-1; i++) {
  for (j=0; j<n-1-i; j++)
    if (a[j+1] < a[j]) {  /* compare the two neighbors */
      tmp = a[j];         /* swap a[j] and a[j+1]      */
      a[j] = a[j+1];
      a[j+1] = tmp;
  }
}

for(int i = 0; i < n-1; i++)
{
    for(int j = 0; i < n; j++)
    {
          if( a[i] < a[j] )
          {
               int temp = a[i];
               a[i] = a[j];
               a[j] = temp;
           }
       }
}

vector<int> array;
// fill array is not shown
//
// now sort it
std::sort(array.begin(),array.end());