array, vector 排序算法(1)

1. vector 冒泡排序

  vector<int> bubbleSort(vector<int> sortVec){

            int count, swap, temp;

           do{

               swap = 0;

               for (count = 0; count < sortVec.size() - 1; count ++){

                       if (sortVec[count] > sortVec[count + 1]){

                              temp = sortVec[count];

                             sortVec[count] = sortVec[count + 1];

                             sortVec[count + 1] = temp;

                             swap = 1;

                       }

               }

           }while(swap!=0)

    return sortVec;

  }

 

2 vector 选择排序

 vector<int> selectionSort(vector<int> sortVec){

          int start, minValue, minIndex;

          for (start = 0; start < sortVec.size()-1; start ++){

                 minIndex = start;

                 minValue = sortVec.at(start);

                 for (int index = start + 1; index < sortVec.size(); index ++){

                         if (sortVec.at(index) < minValue){

                               minValue = sortVec.at(index)

                               minIndex = index;

                         }

                 }

                sortVec.at(minIndex) = sortVec.at(start);

                sortVec.at(start) = minValue;

          }

      return sortVec;

 }