The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Jul 2017 |
| Last Sign in: | 305 Weeks Ago |
| Questions Answered: | 15833 |
| Tutorials Posted: | 15827 |
MBA,PHD, Juris Doctor
Strayer,Devery,Harvard University
Mar-1995 - Mar-2002
Manager Planning
WalMart
Mar-2001 - Feb-2009
[I want to change the following into linked list instead of array]
Â
#define CARDS_PER_DECKÂ 52Â
int main()
{
CARD deck[CARDS_PER_DECK];
CARD userDeck[CARDS_PER_DECK / 2];
CARD compDeck[CARDS_PER_DECK / 2];
int deckSize =52;
int playerSize = 0;
deal(deck, userDeck, compDeck, deckSize, &playerSize, &cpuCount);
return 0;
}
void deal(CARD deck[], CARD userDeck[], CARD cpuDeck[],int deckCount, int * userCount, int * cpuCount){
int i;
Â
for (i = 0; i < deckCount; i++){
if (i % 2 == 0){
userDeck[(*userCount)] = deck[i];
(*userCount)++;
}
else
{
cpuDeck[(*cpuCount)] = deck[i];
(*cpuCount)++;
}
}
}
----------- Â ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly