Question

***C++ Coding***

Write a program for sorting a list of integers in ascending order using the bubble sort algorithm. Please include comments to understand code.

Requirements
Implement the following functions:

1. int readData( int **arr)
   arr is a pointer to pointer for storing the integers. The function returns the number of integers.
   The function readData reads the list of integers from a file call data.txt into the array arr. The first integer number in the file is the number of intergers. After the first number, the file lists the integers line by line.
2. void bsort(int *arr, int last)
   arr is a pointer to an array of integers to be sorted. last is the number of elements in the array. The function bsort sorts the list of integers in ascending order.
   Here is the Link to the Bubble Sort.
3. writeToConsole(int * arr, int last)
   arr is a pointer to an array of integers. last is the number of elements in the array. The function writeToConsole displays the sorted list.
4. Do not use the array notation in your solution.

Here is the content of the file data.txt.
9
8
4
7
2
9
5
6
1
3

Answer 1

// do comment if any problem arises

//code

#include <iostream>

#include <fstream>

using namespace std;

//this function reads data from data.txt

int readData(int **arr)

{

    //open file for input

    ifstream infile("data.txt");

    //if can't open file

    if (!infile.is_open())

    {

        cout << "Can't open input file\n";

        exit(1);

    }

    //number of integers in data.txt

    int count = 0, temp;

    //read integer 1 by 1

    while (infile >> temp)

    {

        *(*(arr) + count) = temp;

        count++;

    }

    //close file

    infile.close();

    return count;

}

//this function sorts given array of size last using bubble sort

void bsort(int *arr, int last)

{

    //for i from 0 to last -1

    for (int i = 0; i < last - 1; i++)

    {

        //for j from 0 to last-i-1

        for (int j = 0; j < last - i - 1; j++)

        {

            // if current element is greater than next element

            if (*(arr + j) > *(arr + j + 1))

            {

                //this performs swap of jth with j+1th element

                int temp = *(arr + j);

                *(arr + j) = *(arr + j + 1);

                *(arr + j + 1) = temp;

            }

        }

    }

}

//this function writes sorted array to output

void writeToConsole(int *arr, int last)

{

    cout << "Sorted Data: ";

    for (int i = 0; i < last; i++)

        cout << *(arr + i) << " ";

    cout << endl;

}

int main()

{

    //create array

    int *array = new int[100];

    int last = readData(&array);

    bsort(array, last);

    writeToConsole(array, last);

    delete[] array;

}

data.txt:

Output: