Card Dealing Problem

This is a discussion on Card Dealing Problem within the C++ Programming forums, part of the General Programming Boards category; This is an exercise I am doing from C++ How to Program fourth edition by Deitel an Deitel.
The problem ...

Have rethought the problem a bit and see I can't use char * [5] for the hand.
For these reasons
if I set it to "" the size is set and strcat doesn't allocate for the new space needed hence the crash (guess you have to make half the mistakes you read about to learn the lesson).

two it won't help me to determine the hand if i create the hand this way so it's back to the drawing board.

curlious : Im not sure I understand your program. You shuffle function place the number 1 to 52 randomly in a two dimentional array. If at position wDeck[2][7] you find the value 36, what card is that ? I just dont follow.

In the deal function you send the number of card, the number of players and a empty hands[][] array but you dont seem to send the newly shuffled deck ... confussed.

If I did your homework for you, then you might pass your class without learning how to write a program like this. Then you might graduate and get your degree without learning how to write a program like this. You might become a professional programmer without knowing how to write a program like this. Someday you might work on a project with me without knowing how to write a program like this. Then I would have to do you serious bodily harm. - Jack Klein

The reason I represent the desk with a two demensional array is because that was the given in the problem that is from Dietel and Dietels C++ How to Program Fourth Edition.

Card [2][7] = 32 for instance would mean the seven of Diamonds is the thirty second card in the deck. By dealing the first ten cards to my hand array so to speak, it is taking the cards off the top of the deck.

Admitidly as was pointed out I do not return the remainder of the deck or alter the array to reflect only a partial deck remaining, but as to returning a shuffled deck after dealing, that is not done.

Finally because of the two-d deck representation I have been considering skipping the problem as I think it an inefficient way of dealing with the data when determining hands.

What do you think continue on or complete the remaining exercises dealing with this piece of code?