Question

You are supposed to implement Bubble Sort. Use Test-Driven Development to implement this function.

Use NotePad++ to write your code and test. Need to see all the steps and intermediate code/test cases.

I don't need to run your code. That means it is ok if you don't follow a specific syntax.

Answer 1

#include <iostream>

using namespace std;
void BubbleSort(int values[], int numValues){
       int i, j;
       int temp;
       // outer loop to travel through the all elements
       for (i = 0; i < numValues - 1; i++) {
           // inner loop to compare the outer loop elements
          
           for (j = 0; j < numValues - i - 1; j++)
               // if element at j< than j+1 than swap both
               if (values[j] > values[j + 1]) {
                   // swap logic
                   temp = values[j];
                   values[j] = values[j+1];
                   values[j+1] = temp;
               }
      
       }
      
   }
void printArray(int *arr,int size){
for(int i=0;i<size;i++)
cout<<arr[i]<<" ";
cout<<endl;
}

int main()
{
int size;
int *arr;
cout<<"Enter size: ";
cin>>size;
arr=new int[size];
cout<<"Enter "<<size<<" elements: ";
for(int i=0;i<size;i++)
cin>>arr[i];
cout<<"Orignal Array: "<<endl;
printArray(arr,size);
BubbleSort(arr,size);
cout<<"Sorted Array: "<<endl;
printArray(arr,size);
  

return 0;
}

Note : Please comment below if you have concerns. I am here to help you

If you like my answer please rate and help me it is very Imp for me