Implement a bubble Sort on an array - C++ Data Structure

C++ examples for Data Structure:Sort

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

Description

Implement a bubble Sort on an array

Demo Code

#include <iostream>
using namespace std;
int bubbleSort(int [], int);  // function prototype
int main()//from w w w.ja  v  a  2  s.  c  o  m
{
   const int NUMEL = 10;
   int nums[NUMEL] = {22,5,67,8,4,2,11,9,3,1};
   int i, moves;
   moves = bubbleSort(nums, NUMEL);
   cout << "The sorted list, in ascending order, is:\n";
   for (i = 0; i < NUMEL; ++i)
      cout << "  " << nums[i];
   cout << endl << moves << " moves were made to sort this list\n";
   return 0;
}
int bubbleSort(int num[], int numel)
{
   int i, j, temp, moves = 0;
   for (i = 0; i < (numel - 1); i++)
   {
      for (j = 1; j < numel; j++)
      {
         if (num[j] < num[j-1])
         {
            temp = num[j];
            num[j] = num[j-1];
            num[j-1] = temp;
            moves++;
         }
      }
   }
   return moves;
}

Result


Related Tutorials