Question

*in Java

1. Create a card class with two attributes, suit and rank.

2.In the card class, create several methods:

a. createDeck – input what type of deck (bridge or pinochle) is to be created and output an array of either 52 or 48 cards.

b.shuffleDeck – input an unshuffled deck array and return a shuffled one. + Create a swap method to help shuffle the deck

c. countBridgePoints – inputs a 13-card bridge ‘hand’-array and returns the number of high-card points

d. writeHandOutput – input a bridge-hand and prints it out on the monitor

e. writeDeckOuput – inputs a deck of bridge cards and prints it out on the monitor main method should:

a. Ask the user what kind of deck he/she wants to create (pinochle or bridge). For this project, have the user input ‘bridge’.

b. Create the user-asked-for deck

c. Print out the unshuffled deck

d. Shuffle the deck

e. Create 4 Bridge hands of 13 cards each, call them North, South, East and West. + Deal every fourth card to each of the hands

f. Calculate the high-card-points in each hand

g. Print out each hand and the number of high-card-points associated with each hand

h. Sort the hands from highest to lowest number of points – use Insertion Sort we did before

i. Print out each hands points from highest to lowest.

Answer 1

import java.util.*;

class Card{

    String[] rank;

    String[] suit;

    int getRank(String s){  //To return highest rank for high-card used for sorting

        switch(s){

            case "A": return 1;

            case "K": return 2;

            case "Q": return 3;

            case "J": return 4;

            case "10": return 5;

            case "9": return 6;

            case "8": return 7;

            case "7": return 8;

            case "6": return 9;

            case "5": return 10;

            case "4": return 11;

            case "3": return 12;

            case "2": return 13;

        }

        return 0;

    }

    void createDeck(String type){

        if(type.equals("bridge")){

            rank = new String[] {"A", "K", "Q", "J", "10", "9", "8", "7", "6", "5", "4", "3", "2"};

            suit = new String[] {"Diamond", "Club", "Heart", "Spade"};

        }

        else{

            rank = new String[] {"A", "A", "10", "10", "K", "K", "Q", "Q", "J", "J", "9", "9"};

            suit = new String[] {"Diamond", "Club", "Heart", "Spade"};

        }

        for(int i=0;i<rank.length;i++){

            for(int j=0;j<suit.length;j++){

                System.out.println(rank[i] + " " + suit[j]);

            }

        }

    }

    void swap(String[] deck, int i, int j){

        String temp = deck[i];

        deck[i] = deck[j];

        deck[j] = temp;

    }

    String[] shuffleDeck(String[] deck){

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

            swap(deck, i, (2*i+5)%52);

        }

        return deck;

    }

    int countBridgePoints(String[] bridgeHand){

        int res = 0;

        for(int i=0;i<bridgeHand.length;i++){

            if(bridgeHand[i].equals("A") || bridgeHand[i].equals("K") || bridgeHand[i].equals("Q") || bridgeHand[i].equals("J")){

                res++;  //if card has either of them, increment count by 1 because its high card deck

            }

        }

        return res;

    }

    void writeHandOutput(String[] bridgeHand){

        for(int i=0;i<bridgeHand.length;i++){

            System.out.print(bridgeHand[i] + " ");

        }

        System.out.println();

    }

    void writeDeckOuput(String[] deck){

        for(int i=0;i<deck.length;i++){

            System.out.print(deck[i] + " ");

        }

        System.out.println();

    }

}

class CardTest{

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        System.out.print("Enter type of deck (bridge or pinochle): ");

        String type = sc.next();    //Input type of card

        Card card = new Card();

        card.createDeck(type);  //Create deck of that type

        System.out.println("Enter the un-shuffled deck of size 52:");

        String deck[] = new String[52];

        for(int i=0;i<deck.length;i++){

            deck[i] = sc.next();    //Input un-shuffled array of deck from user

        }

        card.writeDeckOuput(deck);  //Print un-shuffled deck

        deck = card.shuffleDeck(deck);  //Shuffle the deck

        String[] north = new String[13];    //

        String[] south = new String[13];

        String[] east = new String[13];

        String[] west = new String[13];

        int in = 0, t = -1, p = -1;

        while(in < 13){

            t += 4;

            north[in] = deck[t%52];

            t += 4;

            south[in] = deck[t%52];

            t += 4;

            east[in] = deck[t%52];

            t += 4;

            west[in] = deck[t%52];

            if(t > 51){

                t = ++p;

            }

            in++;

        }

        int northHand = card.countBridgePoints(north);

        int southHand = card.countBridgePoints(south);

        int eastHand = card.countBridgePoints(east);

        int westHand = card.countBridgePoints(west);

        System.out.println("North Hand:");

        card.writeHandOutput(north);

        System.out.println(northHand);

        System.out.println("South Hand:");

        card.writeHandOutput(south);

        System.out.println(southHand);

        System.out.println("East Hand:");

        card.writeHandOutput(east);

        System.out.println(eastHand);

        System.out.println("West Hand:");

        card.writeHandOutput(west);

        System.out.println(westHand);

        int[] points = {northHand, southHand, eastHand, westHand};

        for (int i = 1; i < points.length; i++)

        {  

            int key = points[i];  

            int j = i - 1;  

            while (j >= 0 && points[j] < key)

            {  

                points[j + 1] = points[j];  

                j = j - 1;  

            }  

            points[j + 1] = key;  

        }

        for(int i=0;i<points.length;i++){

            System.out.print(points[i] + " ");

        }

    }

}

output:

Screenshot program: