# Bubble Sort in C++ with examples

3

we will see the working and operations of bubble sort in C++ with proper examples by the sorting of arrays.

## Sorting of Arrays:-

The process of arranging the arrays in some order is called sorting of arrays. There are two types of orders first one is ascending order and the second one is descending order.

In normal routine, two types of sorting techniques are used in C++.

2. Bubble sort.

3. QuickSort.

4. Merge Sort.

## Bubble Sort:-

Bubble sorting is the very commonly and widely used sorting technique in C++ programming. It is also known as the exchange sort. It repeatedly visits the elements of an array and compares the two adjacent elements. It visits the array elements and compare the adjacent elements if they are not in the right order then it puts them into the right order. It continues to swap the elements until no more swaps are required, which means the given array is sorted. It works in the following steps described below:

1. It will compare two adjacent elements, if second element is smaller than the first then it will swap them, if we wanted to sort an array in an ascending order.

2. It will continue the above process of comparing pares, from the first pare to the last pair, at its first iteration the greatest element is placed at the last index of an array.

3. Then it will again repeat the above steps for all the elements by excluding the greatest one.

4. It will continue to repeat until the array becomes sorted.

Let’s take a look towards the following example which will illustrate and completely describe the use, working and operations of bubble sort in C++.

## Example of Bubble Sort:-

Example of Bubble Sort

#include<iostream>
#include<conio.h>
using namespace std;
main()
{
int hold;
int array[5];
cout<<"Enter 5 numbers: "<<endl;
for(int i=0; i<5; i++) { cin>>array[i];
}
cout<<endl;
cout<<"Orignally entered array by the user is: "<<endl;
for(int j=0; j<5; j++)
{
cout<<array[j];
cout<<endl;
}
cout<<endl;
for(int i=0; i<4; i++)
{
for(int j=0; j<4; j++)
{
if(array[j]>array[j+1])
{
hold=array[j];
array[j]=array[j+1];
array[j+1]=hold;
}
}
}
cout<<"Sorted Array is: "<<endl;
for(int i=0; i<5; i++)
{
cout<<array[i]<<endl;
}
getch();
}

Explanation:-

Now this program will be explained with proper example.

Just consider the array entered by the user is:

Now the program will use a nested loop to perform sorting. The iterations of outer loop will specified the number of passes and the inner loop will specify the number of iterations.

At the beginning when the loop begins, the value of i=0, Therefore first pass is started.

## First Pass:

In first pass the value of i=0 and the inner loop came into action, it will perform 4 iterations and check the condition of the following block of statements.

if(array[j]>array[j+1])
{
hold=array[j];
array[j]=array[j+1];
array[j+1]=hold;
}

Iteration no. 1:

At first iteration the value of j=0 and the value of j+1=1, Therefore it will compare the values of zero index and the first index of an array. As we can see that the value at Zero index is smaller than first index, therefore the array remains the same.

Iteration no.2:

At second iteration the value of j=1 and the value of j+1=2, Therefore it will compare the values of first index and the second index of an array. As we can see that the value at second index is smaller than first index, therefore the elements of first and second index will be swap, the new array looks like.

Iteration No.3:

At Third iteration the value of j=2 and the value of j+1=3, Therefore it will compare the values of second index and the Third index of an array. As we can see that the value at third index is smaller than second index, therefore the elements of third and second index will be swap, the new array looks like.

Iteration no.4:

At fourth iteration the value of j=3 and the value of j+1=4, Therefore it will compare the values of third index and the fourth index of an array. As we can see that the value at fourth index is smaller than third index, therefore the elements of fourth and third index will be swap, the new array looks like.

/* */

As you can see that at the end of the first pass the largest value is placed at the last index.

## Second Pass:

### Iteration no. 1:

At first iteration the value of j=0 and the value of j+1=1, Therefore it will compare the values of zero index and the first index of an array. As we can see that the value at Zero index is smaller than first index, therefore the array remains the same.

### Iteration no.2:

At second iteration the value of j=1 and the value of j+1=2, Therefore it will compare the values of first index and the second index of an array. As we can see that the value at second index is greater than first index, therefore the array will be same.

### Iteration No.3:

At Third iteration the value of j=2 and the value of j+1=3, Therefore it will compare the values of second index and the Third index of an array. As we can see that the value at third index is smaller than second index, therefore the elements of third and second index will be swap, the new array looks like.

### Iteration no.4:

At fourth iteration the value of j=3 and the value of j+1=4, Therefore it will compare the values of third index and the fourth index of an array. As we can see that the value at fourth index is greater than third index, therefore the array will remains the same.

As you can see that at the end of the second pass the second largest element is places at the second last index of an array.

## Third Pass:

### Iteration no. 1:

At first iteration the value of j=0 and the value of j+1=1, Therefore it will compare the values of zero index and the first index of an array. As we can see that the value at Zero index is smaller than first index, therefore the array remains the same.

### Iteration no.2:

At second iteration the value of j=1 and the value of j+1=2, Therefore it will compare the values of first index and the second index of an array. As we can see that the value at second index is smaller than first index, therefore the elements will swap and new array will be look like.

### Iteration No.3:

At Third iteration the value of j=2 and the value of j+1=3, Therefore it will compare the values of second index and the Third index of an array. As we can see that the value at third index is greater than second index, therefore the array remains the same.

### Iteration no.4:

At fourth iteration the value of j=3 and the value of j+1=4, Therefore it will compare the values of third index and the fourth index of an array. As we can see that the value at fourth index is greater than third index, therefore the array will remains the same.

As you can see that at the end of the third pass the second largest element is places at the third last index of an array.

## Fourth Pass:

### Iteration no. 1:

At first iteration the value of j=0 and the value of j+1=1, Therefore it will compare the values of zero index and the first index of an array. As we can see that the value at Zero index is greater than first index, therefore the elements will swap and new array will be look like.

At this point the loop is completed and the fourth last value is placed at the fourth last index of an array. Which means the position of fourth value is final, the position of fifth value is automatically finalized because it automatically placed at index one. Now at the end outer loop will also terminate and we will get the perfectly sorted array in ascending order with the help of Bubble sort technique.

If you like my work and wanted to read my other articles then visit my Homepage.

Bubble Sort in C++ with examples
4.9 (97.14%) 7 vote[s]

(royal52) is a software engineer. He is good at authoritative link building, Content Writing, SEO, Web Development, Wordpress, HTML, CSS, JAVASCRIPT, Game Development, Unity3d, Graphic Designing, Logo Designing, Android Development and Ios Development. Last but not least, he is passionate about development and gaming.

1. Great explanation!

2. thank you its very helpful

3. thanks a lot buddy.
you really helped me a lot.

4. thanks a lot for the explanation!

5. No wonder I thought this code and example look familiar. Good job fellow ravian!

6. thankxx alot bro good effort for us thankx

7. can we use while loop instead of for loop. if yes, means share the code please

• yes we can use a while loop.

• I have updated my comment with a code block containing while loop, cheers.

• Okay, that’s the code of Bubble sort by using While Loop written in C++.

while(i < 4) { int j = 0; while(j < 4) { if(array[j]>array[j+1])
{
hold=array[j];
array[j]=array[j+1];
array[j+1]=hold;
}
j++;
}
i++;
}

If you have any other questions then let me know, thanks.

8. can any 1 provide me the prog. in C++ to print the given numbers in descending order using Bubble sort

• just write if(array[j] lesser then array[j+1]) instead of if(array[j] greater then array[j+1]) and it will sort the array in descending order.