Enhanced Bubble Sort on vector of number - C++ STL

C++ examples for STL:vector

  1. HOME
  2. C++
  3. STL
  4. vector

Description

Enhanced Bubble Sort on vector of number

Demo Code

#include <cstdlib>
#include <iostream>
#include <vector>
#include <ctime>
// print a vector
template <typename T>
void printVector(const std::vector<T>& data) {
    for (T elem : data) std::cout << elem << " ";

    std::cout << std::endl;/*w  ww .j  a v  a2s  . c o  m*/
}

void bubbleSort(std::vector<int>&);

int main(int argc, const char* argv[]) {
    std::srand(time(0));

    const size_t limit = 100;
    const size_t vecSize = 20;
    std::vector<int> intVec;

    // randomise elements of intVec
    for (size_t i = 0; i < vecSize; ++i)
        intVec.push_back(((rand() % limit) + 1));

    std::cout << "\nBefore sorting:" << std::endl;
    printVector(intVec);

    bubbleSort(intVec);

    std::cout << "\nAfter Sorting:" << std::endl;
    printVector(intVec);

    return 0;
}
// bubble sort vector
void bubbleSort(std::vector<int>& intVec) {
    size_t size = intVec.size() - 1;
    bool swap = false;

    for (size_t i = 0; i < size; swap = false, ++i) {
        for (size_t j = 0; j < size - i; ++j) {
            if (intVec[j] > intVec[j + 1]) {
                int tmp = intVec[j];

                intVec[j] = intVec[j + 1];
                intVec[j + 1] = tmp;

                swap = true;
            }
        }
        if (!swap) break;
    }
}

Result


Related Tutorials