C++ project

void deckSort (vector<Card> & deck) {
  /* In this function add the code for answering the Question 1 in the assignment.
  The sorted deck of cards should be present in the parameter deck passed to this function.
  */

}

void inverseDeckSort (vector<Card> & deck) {
  /* In this function add the code for answering the Question 3 in the assignment.
  The sorted deck of cards should be present in the parameter deck passed to this function.
  */

}

void deckSort2 (vector<Card> & deck) {
  /* In this function add the code for answering the Question 2 in the assignment.
  The sorted deck of cards should be present in the parameter deck passed to this function.
  */

}











Question 1

You have been given a shuffled deck of cards. Your job is to write a program that puts a deck of cards in order by suit (in the order spades, hearts, clubs, diamonds). Further, within each suit the cards should be organized by rank from 1 to 13. The only operation you are allowed to perform on the cards is to look at the value of two cards at a time and exchange them. You can't look at the value of more than two cards at a time. You can do this operation as many times as you like.

The code for this program should be written in the function deckSort in the file main.cpp. The function takes a single argument deck. deck is a vector that contains objects of type Card. The function does not return anything so the sorted deck should be present in the variable deck after the function completes.

Question 2

Write a program to solve the problem described in Question 1 by overloading the greater than operator in the class Card.

For this program you will have to declare an overloaded greater than operator in the file Card.h and provide its implementation in the file card.cpp. In addition, you have to write code for sorting in the function deckSort2 in the file main.cpp. The API of the function is similar to the API of the deckSort so follow the same rules regarding returning results.

Question 3

Modify the program you wrote in Question 1 such that the final ordered deck contains cards in the same order by suit (in the order spades, hearts, clubs, diamonds). But, within each suit, the cards are organized by rank from 13 to 1.

The code for this program should be written in the function inverseDeckSort in the file main.cpp. The API of the function is similar to the API of the deckSort so follow the same rules regarding returning results.