Question

Replace "#include <algorithm>" and "sort(stalls, stalls + count, comparator2);" with simple and basic C++

#include <iostream>
#include <string>
#include <fstream>
#include <algorithm>

using namespace std;

#define MAX 100

struct Stall
{
string stallName;
float income;
float expense;
};

// to sort in decreasung net income
bool comparator(Stall x, Stall y)
{
return (x.income - x.expense) > (y.income - y.expense);
}

// to sort in increasing profit
bool comparator2(Stall x, Stall y)
{
return ((x.income - x.expense) < (y.income - y.expense));
}

int main()
{
Stall stalls[MAX];
string name;
float income, expense;

string fileName = "stalls.txt";
fstream file;
file.open(fileName.c_str(), ios::in);
fstream outfile("output.txt", ios::out);

int i = 0;

while (true)
{
file >> name;

if (name.compare("XXXXXX") == 0 || name.compare("xxxxxx") == 0)
{
break;
}

file >> income;
file >> expense;

stalls[i].stallName = name;
stalls[i].income = income;
stalls[i].expense = expense;

i++;
}

int count = i;

sort(stalls, stalls + count, comparator);

int countProfit = 0;
long totalProfit = 0;

outfile << "Report in decreasing order of the income -" << endl;
for (int i = 0; i < count; i++)
{
outfile << stalls[i].stallName << " " << stalls[i].income - stalls[i].expense << endl;

if ((stalls[i].income - stalls[i].expense) > 0)
{
countProfit++;
totalProfit += stalls[i].income - stalls[i].expense;
}
}

outfile << endl << "Stats: -" << endl;
outfile << "Number of stalls: " << count << endl;
outfile << "Number of stalls which made the profit: " << countProfit << endl;
outfile << "Total profit from all the stalls: " << totalProfit << endl;

sort(stalls, stalls + count, comparator2);
outfile << "Stalls with profits: ";
for (int i = 0; i < count; i++)
{
if ((stalls[i].income - stalls[i].expense) > 0)
outfile << stalls[i].stallName << " ";
}
outfile << endl;

file.close();

return 0;
}

Answer 1

Here is the completed code for this problem. Comments are included, go through it, learn how things work and let me know if you have any doubts or if you need anything to change. If you are satisfied with the solution, please rate the answer. Thanks

Note: This is the exact version of your existing program using simple c++ code instead of using algorithm.h and sort method. I have not changed any logic in the code; just changed the technique of sorting.

#include <iostream>

#include <string>

#include <fstream>

using namespace std;

#define MAX 100

struct Stall {

    string stallName;

    float income;

    float expense;

};

//method to sort the stalls in descending order of net income/profit

void sortByNetIncome(Stall *stalls, int size){

                //using bubble sort algoithm to sort the stalls

                for(int i=0;i<size;i++){

                                for(int j=0;j<size-1;j++){

                                               if((stalls[j].income-stalls[j].expense) < (stalls[j+1].income-stalls[j+1].expense)){

                                                               //swapping elements at indices j and j+1

                                                               Stall temp=stalls[j];

                                                               stalls[j]=stalls[j+1];

                                                               stalls[j+1]=temp;

                                               }

                                }

                }

}

//method to sort the stalls in ascending order of net income/profit

void sortByNetProfit(Stall *stalls, int size){

                for(int i=0;i<size;i++){

                                for(int j=0;j<size-1;j++){

                                               if((stalls[j].income-stalls[j].expense) > (stalls[j+1].income-stalls[j+1].expense)){

                                                               Stall temp=stalls[j];

                                                               stalls[j]=stalls[j+1];

                                                               stalls[j+1]=temp;

                                               }

                                }

                }

}

int main()

{

    Stall stalls[MAX];

    string name;

    float income, expense;

    string fileName = "stalls.txt";

    fstream file;

    file.open(fileName.c_str(), ios::in);

    fstream outfile("output.txt", ios::out);

    int i = 0;

    while (true) {

        file >> name;

        if (name.compare("XXXXXX") == 0 || name.compare("xxxxxx") == 0) {

            break;

        }

        file >> income;

        file >> expense;

        stalls[i].stallName = name;

        stalls[i].income = income;

        stalls[i].expense = expense;

        i++;

    }

    int count = i;

    //sorting in descending order of income/profit

                sortByNetIncome(stalls,count);

               

    int countProfit = 0;

    long totalProfit = 0;

    outfile << "Report in decreasing order of the income -" << endl;

    for (int i = 0; i < count; i++) {

        outfile << stalls[i].stallName << " " << stalls[i].income - stalls[i].expense << endl;

        if ((stalls[i].income - stalls[i].expense) > 0) {

            countProfit++;

            totalProfit += stalls[i].income - stalls[i].expense;

        }

    }

    outfile << endl

            << "Stats: -" << endl;

    outfile << "Number of stalls: " << count << endl;

    outfile << "Number of stalls which made the profit: " << countProfit << endl;

    outfile << "Total profit from all the stalls: " << totalProfit << endl;

                //sorting in ascending order of income/profit

    sortByNetProfit(stalls,count);

    outfile << "Stalls with profits: ";

    for (int i = 0; i < count; i++) {

        if ((stalls[i].income - stalls[i].expense) > 0)

            outfile << stalls[i].stallName << " ";

    }

    outfile << endl;

    file.close();

    return 0;

}