Bubble sort algorithm to sort an array - C++ Data Structure

C++ examples for Data Structure:Sort

  1. HOME
  2. C++
  3. Data Structure
  4. Sort

Description

Bubble sort algorithm to sort an array

Demo Code

#include <iostream>
using namespace std;
void sort(int n);
void swap(int *p1, int *p2);
int a[10];//from   w  ww  .  j  a v  a 2  s  .c o m
int main()
{
  for (int i = 0; i < 10; ++i) {
    cout << "Enter array element #" << i << ": ";
    cin >> a[i];
  }
  sort(10);
  cout << "Here is the array, sorted:" << endl;
  for (int i = 0; i < 10; ++i) {
    cout << a[i] << "  ";
  }
  return 0;
}
// Sort function: sort array named a with n elements.
void sort(int n) {
  int lowest = 0;
  for (int i = 0; i < n - 1; ++i) {
    // finds the lowest element in the range i to n-1; the index is set to the variable named low.
    int low = i;
    for (int j = i + 1; j < n; ++j) {
      if (a[j] < a[low]) {
        low = j;
      }
    }
    // This part of the loop performs a swap if needed.
    if (i != low) {
      swap(&a[i], &a[low]);
    }
  }
}
// Swap function.
void swap(int *p1, int *p2) {
  int temp = *p1;
  *p1 = *p2;
  *p2 = temp;
}

Result


Related Tutorials