Bubble Sort program and explanation

How Bubble Sort Algorithm Works?

Bubble sort c++

bubble sort cpp

An example of bubble sort. Starting from the beginning of the list, compare every adjacent pair, swap their position if they are not in the right order (the latter one is smaller than the former one). After each iteration, one less element (the last one) is needed to be compared until there are no more elements left to be compared.

Source: Wikipedia

Here is the code for Bubble sort in C++

PROGRAM:

#include<iostream>
using namespace std;

int main()
{
 //declaring array
 int array[5];
 cout<<"Enter 5 numbers randomly : "<<endl;
 for(int i=0; i<5; i++)
 {
 //Taking input in array
 cin>>array[i];
 }
 cout<<"Input array is: "<<endl;
 for(int j=0; j<5; j++)
 {
 //Displaying Array
 cout<<"\t\t\tValue at "<<j<<" Index: "<<array[j]<<endl;
 }
 // Bubble Sort Starts Here
 int temp;
 for(int i2=0; i2<=4; i2++)
 {
 for(int j=0; j<4; j++)
 {
 //Swapping element in if statement
 if(array[j]>array[j+1])
 {
 temp=array[j];
 array[j]=array[j+1];
 array[j+1]=temp;
 }
 }
 }
 // Displaying Sorted array
 cout<<" Sorted Array is: "<<endl;
 for(int i3=0; i3<5; i3++)
 {
 cout<<"\t\t\tValue at "<<i3<<" Index: "<<array[i3]<<endl;
 }
 return 0;
}

 

OUTPUT:

Bubble sort c++

Leave a Reply