上面的函数还有：
DeckOfCards（构造函数）用于初始化数组deck
       //DeckOfCards default constructor initializes deck
       DeckOfCards()
       {
            //loop through rows of deck
            for( int row = 0; row <= 3; row++ )
            {
                 //loop through columns of deck for current row
                 for( int column = 0; column <= 12; column++ )
                 {
                      deck[row][column] = 0;//initialize slot of deck to 0
                 }//end inner for
            }// end outer for
            
            srand( time( 0 ) );//seed random nmber generator
       }//end DeckOfCards default constructor
       
       // shuffle cards in deck
deal，用于定义牌及发牌
       //deal cards in deck
       void deal()
       {
            //initialize suit array
            static const char *suit[4] = { "Hearts", "Diamonds", "Clubs", "Spades" };
            
            //initialize face array
            static const char *face[13] = { "Ace", "Deuce", "Three", "Four", "Five", "Six",
                   "Seven", "Eight", "Nine", "Ten", "Jack", "Queen", "King" }; 
            //for each of the 52 cards 
            for( int card = 1; card <= 52; card++ )
            {
                 //loop through rows of deck
                 for( int row = 0; row <= 3; row++ )
                 {
                      //loop through coloums of deck for current row
                      for( int coloum = 0; coloum <= 12; coloum++ )
                      {
                           //if slot contains current card, display card
                           if( deck[row][coloum] == card )
                           {
                               cout << setw( 5 ) << right << face[coloum] << " of " 
                               << setw( 8 ) << left << suit[row] << ( card % 2 == 0 ? '\n' : '\t' );
                           }//end if
                      }//end innermost for
                 }//end inner for 
            }//end outer for
       }//end function deal
两个函数都封装在 类  DeckOfCards 中。

//这段代码将1--52这些数字存储在card数组中模拟扑克的52张牌，然后利用方法 fresh(int [] card)将数组中数据的顺序打乱后输出，模拟洗牌的过程。

class Demo
{
    public static void main(String[]args)
    {
        int [] card = new int[52];
        for(int i=0;i<card.length;i++)
            card[i] = i+1;
            
        Demo.print(card);
        Demo.fresh(card);
        Demo.print(card);            
    }
    
    public static void print(int [] card)
    {
        for(int i=0;i<card.length;i++)
            System.out.print (card[i]+"  ");
        
        System.out.println ();    
    }
    
    public static void fresh(int [] card)
    {
        for(int i=0;i<card.length*2;i++)
        {
            int index1 = (int)(Math.random()*card.length);
            int index2 = (int)(Math.random()*card.length);            
            int tmp = card[index1];card[index1]=card[index2];card[index2]=tmp;
        }
    }
}