冒泡排序

 bool bExchanged = false;

 for (size_t i = 0; i < vctrSort.size() - 1; ++i)
 {
  bExchanged = false;

  for (size_t j = 0; j < vctrSort.size() - i - 1; ++j)
  { 
   if (vctrSort.at(j) > vctrSort.at(j + 1))
   {

    bExchanged = true
    std::swap(vctrSort.at(j), vctrSort.at(j + 1));
   }
  }

  if (!bExchanged)
  {
   break;
  }

 }