Question

Sort the following list using the bubble sort algorithm as discussed in this chapter. Show the list after each iteration of the outer for loop.2) 82, 17, 40, 28, 15, 55, 46, 93, 6, 67, 11, 3 6.

in c++

Answer 1

#include <iostream>
using namespace std;

int main()
{
int arr[] = {82,17,40,28,15,55,46,93,6,67,11,3};
int n= sizeof(arr)/sizeof(arr[0]);
int temp;

for(int i = 0; i < n; i++)
{
for(int j = 0; j < n-i-1; j++)
if(arr[j] > arr[j+1])
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
cout<<"\n\nIteration "<<i+1<<endl;
for (int k=0; k < n; k++)
cout<<arr[k]<<" ";
}
cout<<"\n\nFinal Sorted List: ";
for (int i=0; i < n; i++)
cout<<arr[i]<<" ";
cout<<endl;
return 0;
}

Output of the Program:

Elaboration
int n= sizeof(arr)/sizeof(arr[0]); // Finds number of elements in the list.

sizeof(arr) = Total size, [12*4 bytes = 48 bytes]

sizeof(arr[0]) = size of an element in the array, [ 4 bytes for integer]

• In each iteration we swap each consecutive elements till the end of the array.
• This makes the array sorted one by one from the last to the first.