c++ Need my output sorted to dictionary order. The cards recognize the group the

Question

c++ Need my output sorted to dictionary order. The cards recognize the group they need to be in, i just need them to print out in order. My code is included below.

The numbers are ordered 1, 2, 3, the shading is ordered empty, striped, filled, the color is ordered brown, orange, yellow, and the shapes are ordered circle, square, triangle.

Each group is output by first sorting the cards in the group, and then printing out each of the cards in the group (using the same format as the input file) separated by a period and a space.

// Class to represent a Card
class SetCard
{
public:
   SetCard() {};
   SetCard(int n, string s, string c, string f);
   int num;
   string shape;
   string color;
   string fills;
   string toString();
};

// constructor
SetCard::SetCard(int n, string s, string c, string f)
{
   num = n;
   shape = s;
   color = c;
   fills = f;
}

// String representation of card
string SetCard::toString()
{
   ostringstream oss;
   oss << num << " " << shape << " " << color << " " << fills;
   return oss.str();
}

int main()
{

   bool stop = false; // to keep track of when to stop

   do {
       cout << "Enter the set input file name (or "done" to terminate the program):" << endl;
       string fname;
       cin >> fname;

       SetCard cards[1000];
       int len = 0;

       // if done entered stop the program
       if (fname.compare("done") == 0)
           stop = true;
       else
       {
           ifstream infile(fname.c_str());
           int n;
           string s, c, f;

           while (infile >> n >> s >> c >> f) // reading from input file line by line
           {
               SetCard card(n, s, c, f); // create Card object
               cards[len] = card; // Add it to an array
               len++;
           }

           bool isFound = false;
           for (int i = 0; i < len - 2; i++) // First card in comparison
           {
               for (int j = i + 1; j < len - 1; j++) // Second card in comparison
               {
                   for (int k = j + 1; k < len; k++) // Third card in comparison
                   {
                       // Checking if all or None match for attribute 1
                       if ((cards[i].num == cards[j].num && cards[i].num == cards[k].num) ||
                           (cards[i].num != cards[j].num && cards[i].num != cards[k].num && cards[j].num != cards[k].num))
                       {
                           // Checking if all or None match for attribute 2
                           if ((cards[i].shape.compare(cards[j].shape) == 0 && cards[i].shape.compare(cards[k].shape) == 0) ||
                               (cards[i].shape.compare(cards[j].shape) != 0 && cards[i].shape.compare(cards[k].shape) != 0 && cards[j].shape.compare(cards[k].shape) != 0))
                           {
                               // Checking if all or None match for attribute 3
                               if ((cards[i].color.compare(cards[j].color) == 0 && cards[i].color.compare(cards[k].color) == 0) ||
                                   (cards[i].color.compare(cards[j].color) != 0 && cards[i].color.compare(cards[k].color) != 0 && cards[j].color.compare(cards[k].color) != 0))
                               {
                                   // Checking if all or None match for attribute 4
                                   if ((cards[i].fills.compare(cards[j].fills) == 0 && cards[i].fills.compare(cards[k].fills) == 0) ||
                                       (cards[i].fills.compare(cards[j].fills) != 0 && cards[i].fills.compare(cards[k].fills) != 0 && cards[j].fills.compare(cards[k].fills) != 0))
                                  
                                   {
                                      
                                       cout << cards[i].toString() << ", " << cards[j].toString() << ", " << cards[k].toString() << endl;
                                       isFound = true;
                                   }
                               }
                           }
                       }
                   }
               }
           }

           // If even 1 set isn't found, show the below message
           if (!isFound)
               cout << "No sets" << endl;
       }

   } while (!stop);

   return 0;
}

messages Microsot Vis Studio O A https://wwwchegg.comstudyma/post View Project Build Debug Team Tool window Help * > S | Dehlig a pad File Edit Format view Help that i need it to look like: Example .exe, output sorted My code, i got them to recognize the sets, but need output sorted Crpty green diamond, 1 cmpty purple squ iEely,1 cmpty red cal empty green diased,1 striped green diamond, 1 tilled green diamond 2 eroty green diamond, 1 striped purple diamond, I filled r Crpty green diamond,1 st d purple squively, illed red ova empty green diased,1 striped red squiggly,1 tiled purple oval 2 eroty green diamond, 2 empty green diamond, 3 empty green diamond empty green diamond, 2 crupty green oval,3 empty green squial ely green diner aply gy squiggly, empty gre enoty Areen diamond,2 empty purple squiggly.3 empty red oval Crpty green diamond, 2 striped purple oval, 3 led red squieely empty green diased, 2 striped red diamond, 3 tilled purple di 2 eroty green diamond, 2 filled green diamond, 3 striped green diamond Crpty green diamond, 2 filled green oval, 3 striped green squirply ely green diner d, 2 +illed pn pl. 2 eroty green diamond, 2 filled purple squiggly.3 striped red oval Crpty green diamond, 2 filled red squiggly, striped purple oval ely gr quiggly,1 iped purple dy ed red 2 eroty green squiggly,1 striped red oval, 1 filled purple diamond 1 Crpty green squiggly,2 crupty green diamond, 3 Crpty green oval eply green squiggly,,2 empt B aply gy 2 eroty green squiggly,2 empty green squiggly , 3 empty green squietly Crpty green squiggly,2 striped green oval, led green diamond ely gr quiggly,2 iped purple diemurd, 3 tilled red ovel 2 eroty green squiggly,2 striped red diamond, 3 filled purple oval Crpty green squiggly,2 filled green wal, 3 striped green diamond empty green squiggly, 2 tilled purple diased, 3 striped red ovel 2 eroty green squiggly,2 filled red diamond, 3 striped purple oval Crpty purple squigly,1 striped green diamond illed red ova Squiggly. empty green diamond, 2 stripe d purple diamond, 2 illed red diamond 2 empty green diarid, 2 tiled purple diarid, 2 strip 2 empty green diamond, 3 enty purple squiggly, 1 enty red oval empty green diamond, 3 illed green diamond, 1 striped green diamond 2 empty gry iped gre 2 empty green diamond, 3 filled purple squiggly, 1 striped red oval empty green diamond, 3 empty green oval, 1 empty green SquiEEly 2 empty green diaried, tiled red val, 1 striped purpl 2 empty green diamond, 3 striped red diamond, 1 filled purple diamond empty green diamond, 3 illed purple oval, 1 striped red squinely 2 empty gry opty purp. 2 empty green diamond, 2 filled red squiggly, 2 striped purple oval empty green diamond, 3 cmpty green diamond, 1 cripty green diamond 2 empty green diamond, 2 empty green squigel . ipty B empty red diamond, 1 enmpty purple squiggly, 2 empty green oval empty red diamond, 2 striped purple diamond, 1 illed green diamond empty 2 +illed pi striped gr B empty red diamond , 3 enty purple squiggly , 3 empty green oval empty red diamond, 2 illed green oval, 1 striped purple squiezly empty 2 +illed by striped pi B empty red diamond, 2 striped red diamond , 1 filled red diamond empty red diamond , 3 illed purple oval, 3 stripe d green squinely empty opty purp 3 empty gry B empty red diamond, 3 striped green diamond, 3 filled purple diamond empty red diamond, 3 striped red ova) 3 illed red squinely empty striped red squiggly. led B empty red diamond, 2 filled red squiggly, 1 striped red oval empty red diamond, 3 capty green say leEly, 3 Crpty purple oval 83 "g Setc. to string)

Explanation / Answer

#include<iostream>
#include<fstream>
#include<string>
#include<sstream>
using namespace std;
// Class to represent a Card
class SetCard
{
public:
SetCard() {};
SetCard(int n, string s, string c, string f);
int num;
string shape;
string color;
string fills;
string toString();
};
// constructor
SetCard::SetCard(int n, string s, string c, string f)
{
num = n;
shape = s;
color = c;
fills = f;
}
// String representation of card
string SetCard::toString()
{
ostringstream oss;
oss << num << " " << shape << " " << color << " " << fills;
return oss.str();
}

void swapIt(SetCard a[], int i, int j){
SetCard temp;
// Swapping two elements
temp = a[i];
a[i] = a[j];
a[j] = temp;
}

void sorting(SetCard a[]){
// Applying bubble sort to sort elements in dictionary order
for (int i = 0; i < 3 - 1; i++)
{
for (int j = 0; j < 3 - i - 1; j++)
{
//sorting the different cards
if (a[j].num>=a[j + 1].num)
{
if(a[j].num > a[j + 1].num)
swapIt(a, j, j + 1);
// If numbers are in order but shades are not
else if((a[j].num == a[j + 1].num) && (((a[j].fills == "striped" || a[j].fills == "filled") && a[j + 1].fills == "empty") || (a[j].fills == "filled" && a[j+1].fills == "striped")))
swapIt(a, j, j + 1);
// If numbers and shades in order but colors are not
else if((a[j].fills == a[j + 1].fills) && a[j].color > a[j + 1].color)
swapIt(a, j, j + 1);
// If numbers, shades and colors are in order but shapes are not
else if((a[j].color == a[j + 1].color) && (a[j].shape > a[j + 1].shape))
swapIt(a, j, j + 1);
}//if
}//for j
}//for i
}

int main()
{
bool stop = false; // to keep track of when to stop
do {
cout << "Enter the set input file name (or "done" to terminate the program):" << endl;
string fname;
cin >> fname;
SetCard cards[1000], temp[3];
int len = 0;
// if done entered stop the program
if (fname.compare("done") == 0)
stop = true;
else
{
ifstream infile(fname.c_str());
int n;
string s, c, f;
while (infile >> n >> s >> c >> f) // reading from input file line by line
{
SetCard card(n, s, c, f); // create Card object
cards[len] = card; // Add it to an array
len++;
}
bool isFound = false;
for (int i = 0; i < len - 2; i++) // First card in comparison
{
for (int j = i + 1; j < len - 1; j++) // Second card in comparison
{
for (int k = j + 1; k < len; k++) // Third card in comparison
{
// Checking if all or None match for attribute 1
if ((cards[i].num == cards[j].num && cards[i].num == cards[k].num) ||
(cards[i].num != cards[j].num && cards[i].num != cards[k].num && cards[j].num != cards[k].num))
{
// Checking if all or None match for attribute 2
if ((cards[i].shape.compare(cards[j].shape) == 0 && cards[i].shape.compare(cards[k].shape) == 0) ||
(cards[i].shape.compare(cards[j].shape) != 0 && cards[i].shape.compare(cards[k].shape) != 0 && cards[j].shape.compare(cards[k].shape) != 0))
{
// Checking if all or None match for attribute 3
if ((cards[i].color.compare(cards[j].color) == 0 && cards[i].color.compare(cards[k].color) == 0) ||
(cards[i].color.compare(cards[j].color) != 0 && cards[i].color.compare(cards[k].color) != 0 && cards[j].color.compare(cards[k].color) != 0))
{
// Checking if all or None match for attribute 4
if ((cards[i].fills.compare(cards[j].fills) == 0 && cards[i].fills.compare(cards[k].fills) == 0) ||
(cards[i].fills.compare(cards[j].fills) != 0 && cards[i].fills.compare(cards[k].fills) != 0 && cards[j].fills.compare(cards[k].fills) != 0))

{
temp[0] = cards[i];
temp[1] = cards[j];
temp[2] = cards[k];
sorting(temp);
cout << temp[0].toString() << ", " << temp[1].toString() << ", " << temp[2].toString() << endl;
isFound = true;
}
}
}
}
}
}
}
// If even 1 set isn't found, show the below message
if (!isFound)
cout << "No sets" << endl;
}
} while (!stop);

return 0;
}

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.