Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

I need help with the last 2 functions. /* This function allocates memory for a player_t pointer variable. Inputs: player_p_p - memory location of a

I need help with the last 2 functions.

/*

This function allocates memory for a player_t pointer variable.

Inputs:

player_p_p - memory location of a player_t pointer variable

nplayers - number of players that memory needs to be allocated for

Return:

0 - success

1 - failed to allocate memory

Post:

After the function has been called, *player_p_p will point to freshly

allocated memory if malloc was successful. Otherwise *player_p_p will point to

NULL.

*/

int allocate_memory(player_t** player_p_p, long int nplayers)

{

int n;

player_p_p = (player_t**)malloc(nplayers*sizeof(player_t*));

if (player_p_p == NULL)

return 1;

for (n = 0; n < nplayers; n++)

{

if (player_p_p[n] != NULL)

return 0;

}

return 1;

}

/*

This function initialises each field of one player_t struct.

Inputs:

player_p - memory location of the player_t variable. player_p must have been

allocated memory using allocate_memory before calling this function.

nplayers - number of players that memory needs to be allocated for

Post:

After the function has been called, the age field of *player_p will be the

input age, and wickets field of *player_p will be the input wickets.

*/

void init_player(player_t* player_p, int age, int wickets)

{

allocate_memory(&player_p, 1);

player_p -> age = age;

player_p -> wickets = wickets;

}

/*

This function prints a player_t variable in the following format:

player - age:AA wickets:BBB

Inputs:

player_p - variable to be printed

*/

void print_player(player_t player)

{

printf("player - age:%02d wickets:%03d ", player.age, player.wickets);

}

/*

This function compares two players. If *player1_p is older than the *player2_p,

swap them. In all other cases, do not swap them.

Inputs:

player1_p - memory location of the first player

player2_p - memory location of the second player

Post:

After the function has been called, the age of *player1_p is always less than

or equal to *player2_p age.

*/

void order_two_players(player_t* player1_p, player_t* player2_p)

{

}

/*

Sort an array of players in non-decreasing order of the age by implementing the

following algorithm:

1. Compare two adjacent players, if the first player is older than the second,

swap the first and second players.

2. Keep comparing the next two adjacent players in the array, until the end of

the array is reached.

3. Repeat the above steps for players_len times.

This simple algorithm is also known as bubble sort.

Inputs:

players - player_t array (memory location of 0th element in the array)

players_len - number of players in the array

*/

void order_all_players(player_t* players, int players_len)

{

}

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Financial management theory and practice

Authors: Eugene F. Brigham and Michael C. Ehrhardt

12th Edition

978-0030243998, 30243998, 324422695, 978-0324422696

Students also viewed these Programming questions

Question

1. What are the types of wastes that reach water bodies ?

Answered: 1 week ago

Question

Which type of soil has more ability to absorb water?

Answered: 1 week ago