We are playing special cards, which have the usual four suits (Spades, Hearts, Clubs, and Diamonds)...

 

Transcribed Image Text:

We are playing special cards, which have the usual four suits (Spades, Hearts, Clubs, and Diamonds) but the ranks can be any positive integer. You have been delivered a hand of n cards, and you have sorted them in the suit-first order: Spades, Hearts, Clubs, and Diamonds, each suit in non-increasing order. Write an algorithm to reorder your hand of cards into rank-first order: for cards of the same rank, you follow the order of Spade, Heart, Club, and then Diamond. An example can be found in CardGame.java. In your algorithm, you are not allowed to create new cards by calling new Card(). void reorder (Card [] hand) {} We are playing special cards, which have the usual four suits (Spades, Hearts, Clubs, and Diamonds) but the ranks can be any positive integer. You have been delivered a hand of n cards, and you have sorted them in the suit-first order: Spades, Hearts, Clubs, and Diamonds, each suit in non-increasing order. Write an algorithm to reorder your hand of cards into rank-first order: for cards of the same rank, you follow the order of Spade, Heart, Club, and then Diamond. An example can be found in CardGame.java. In your algorithm, you are not allowed to create new cards by calling new Card(). void reorder (Card [] hand) {}

Answer rating: 100% (QA)

Here is a possible algorithm to reorder the hand of cards into rankfirst order void reorderCard hand ... View the full answer