04/10 隨堂練習及作業

注意:

作業請寄到 pyting@ind.ntou.edu.tw
主題請註明 91資管學號EXXXXXXXXX作業X
以附件方式將 zip 起來的檔案傳送給我

將上一次運用 struct 語法製作的洗牌, 發牌程式加上排序功能

#include <stdio.h> #include <stdlib.h> #include <time.h> void shuffle(int deck[4][13]); void deal(int deck[4][13], struct Player players[]); void print(char suiteName[][9], char faceName[][6], struct Player players[]); struct Card { int suite; int face; }; struct Player { Card cards[13]; }; void sortAll(Player players[]); void main() { char suiteName[4][9] = { "Hearts", "Diamonds", "Clubs", "Spades"}; char faceName[13][6] = {"Ace", "Deuce", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Jack", "Queen", "King"}; int deck[4][13]; Player players[4]; srand(time(0)); shuffle(deck); deal(deck, players); sortAll(players); print(suiteName, faceName, players); } void shuffle(int deck[4][13]) { int card; int suite, face; for (suite=0; suite<4; suite++) for (face=0; face<13; face++) deck[suite][face] = -1; for (card=0; card<52; card++) { do { suite = rand() % 4; face = rand() % 13; } while (deck[suite][face]!=-1); deck[suite][face] = card; } } void deal(int deck[4][13], struct Player players[]) { int i, j; int card; for (card=0; card<52; card++) { for (i=0; i<4; i++) for (j=0; j<13; j++) if (deck[i][j] == card) { players[card%4].cards[card/4].suite = i; players[card%4].cards[card/4].face = j; } } } void print(char suiteName[][9], char faceName[][6], struct Player players[]) { int iPlayer; int iCard; for (iPlayer=0; iPlayer<4; iPlayer++) { printf("Player %d\n", iPlayer+1); for (iCard=0; iCard<13; iCard++) printf("%d:%s of %s\n", iCard+1, faceName[players[iPlayer].cards[iCard].face], suiteName[players[iPlayer].cards[iCard].suite]); printf("-----------------------------------\n"); } } void swap(Card *card1, Card *card2); int larger(Card card1, Card card2); void sortBubble(Card cards[]); void sortAll(Player players[]) { int i; for (i=0; i<4; i++) sortBubble(players[i].cards); } void sortBubble(Card cards[]) { int i, j; for (i=0; i<12; i++) for (j=0; j<12-i; j++) if (larger(cards[j], cards[j+1])) swap(&cards[j], &cards[j+1]); } int larger(Card card1, Card card2) { if (card1.suite*13+card1.face > card2.suite*13+card2.face) return 1; else return 0; } void swap(Card *card1, Card *card2) { Card tmp; tmp = *card1; *card1 = *card2; *card2 = tmp; }

回 程式設計課程 首頁

製作日期: 04/10/2003 by 丁培毅 (Pei-yih Ting)
E-mail: pyting@cs.ntou.edu.tw TEL: 02 24622192x6615
海洋大學 理工學院 資訊科學系 Lagoon