Question

C++

2.3 Activity 3: Bubble Sort For this activity, you are required to provide files called act3.cpp as well as a makefile to compile and run it. In your file, act3.cpp, should have a skeleton of a main program as per normal which you will then fill it in as per the following. The objective of this activity is to demonstrate the bubble sort algorithm for arrays. You are going to implement this as a function with the following definition: string bubSort (double arr [8]): Your program will need to read in from a file called list.txt. On each line, will be a comma-delimited list of integer values. Each list will be 8 elements long. Your objective is to sort each of these lists using the bubble sort algorithm. Each line should be sorted, and then displayed in sorted (ascending order with the small- est element at the start of the string) one after the other. Each will be on a new line. As a hint, implementing a function to do the bubble sort itself will make the overall program easier to implement. For example: Given a list: 6.4.3.25.7.5.2.5.1.1,11.6.0.5 The outcome of the sorting should be: 0.5,1.1,2.5,3.25.6.4.7.5.11.6 You will have a maximum of 10 uploads for this task. The string, fstream and stream libraries are recommended. Be sure to include a blank list.txt in your submission.

Answer 1

Here is the code:

# include <iostream>
# include <fstream>
# include <sstream>
using namespace std;

string bubSort(double arr[8]);

int main() {
string iFileName = "list.txt";
//open the file for reading
ifstream iFile(iFileName);
double arr[8];

//read line by line from the file
string line;
while (getline(iFile, line)) {
//from the line, read the 8 values
stringstream l(line);
for (int i=0; i<8; i++) {
l >> arr[i];
}
//print the sorted values string
cout << bubSort(arr) << endl;
}
return 0;
}

string bubSort(double arr[8]) {
bool swapped = true;

//do this while some element has been swapped
while (swapped) {
swapped = false;

//go over the array
for (int i=0; i<7; i++) {
//if current element is more than the next element
if (arr[i] > arr[i+1]) {
//swap them
double t = arr[i];
arr[i] = arr[i+1];
arr[i+1] = t;
swapped = true;
}
}
}

//prepare the string from the sorted array
string s="";
char a[100];
for (int i=0; i<7; i++) {
sprintf(a, "%.3f,", arr[i]);
s += string(a);
}
sprintf(a, "%.3f", arr[7]);
s += string(a);;
return s;
}

Here is a screenshot of the input file "List.txt":

1.43.24.57.19.67.49.34 0.543 -3.2349.92 103.42 5.98764 - 12.45 8567192.345 -3452

Here is a screenshot of the output:

Ꮎ .543,1.4ᎾᏫ ,3.2ᎾᎾ , 4.5ᎾᏫ ,7.1ᎾᏫ ,7.4ᎾᏫ ,9.34Ꮎ ,9.6ᏫᎾ -3452.ᎾᎾᎾ , -12.45Ꮎ , -3.234 ,5.988 ,9.92Ꮎ ,92.345 ,103.42Ꮎ ,85671.ᎾᎾᎾ

Comment in case of any doubts.