c++扑克洗牌的结构体排序😭

Question

完善下列程序，实现对一玩家手中的13张牌按照从小到大排序后输出。

#include <stdio.h>

typedef struct
{ int suit; // 花色 1..4 1～4分别代表梅花,方块,红桃,黑桃
int rank; // 牌点 2..14 其中11～14分别代表J,Q,K,A
} Poker;

void SortCard(Poker cards[], int n)
{ int i,j,p; Poker t;

/*  请在此处补上部分代码，实现程序的功能  */

}

void PrintCard(Poker cards[], int n)
{ char suit[][5]={"","梅花","方块","红桃","黑桃"};
char rank[]="JQKA";
int i;

/*  请在此处补上部分代码，实现程序的功能  */

}

int main()
{ Poker player[13]={ {3,11},{4,3},{2,9},{3,8},{3,14},{1,10},
{1,7},{2,3},{3,6},{1,12},{4,13},{4,6},{2,5}};

printf("发牌后玩家手中的13张牌：\n");
PrintCard(player,13);
SortCard(player,13);
printf("\n理牌后玩家手中的13张牌：\n");
PrintCard(player,13);

getchar();
return 0;

}

Answer 1

大概这种感觉?

#include <stdio.h>

typedef struct
{
    int suit; // 花色 1..4 1～4分别代表梅花,方块,红桃,黑桃
    int rank; // 牌点 2..14 其中11～14分别代表J,Q,K,A
} Poker;
int compare(Poker card1, Poker card2)
{
    if (card1.suit > card2.suit)
    {
        return 1;
    }
    else if (card1.suit < card2.suit)
    {
        return 0;
    }
    else
    {
        if (card1.rank > card2.rank)
            return 1;
        else
            return 0;
    }
}
void SortCard(Poker cards[], int n)
{
    Poker t;

    for (int i = 0; i < n - 1; i++)
    {
        for (int j = 0; j < n - 1 - i; j++)
        {
            if (compare(cards[j], cards[j + 1]))
            {
                t = cards[j + 1];
                cards[j + 1] = cards[j];
                cards[j] = t;
            }
        }
    }
}

void PrintCard(Poker cards[], int n)
{
    char suit[][5] = {"", "梅花", "方块", "红桃", "黑桃"};
    char rank[] = "JQKA";

    for (int i = 0; i < n; i++)
    {
        printf("%s%c\t", suit[cards[i].suit], cards[i].rank > 10 ? rank[cards[i].rank - 11] : (cards[i].rank == 10 ? 'T' : cards[i].rank + '0'));
    }
}

int main()
{
    Poker player[13] = {{3, 11}, {4, 3}, {2, 9}, {3, 8}, {3, 14}, {1, 10}, {1, 7}, {2, 3}, {3, 6}, {1, 12}, {4, 13}, {4, 6}, {2, 5}};

    printf("发牌后玩家手中的13张牌：\n");

    PrintCard(player, 13);

    SortCard(player, 13);

    printf("\n理牌后玩家手中的13张牌：\n");

    PrintCard(player, 13);

    // getchar();

    return 0;
}