Create a baseball lineup for a PONY baseball team

User Requirements

A manager of a PONY $($Protect Our Nation$$s Youth$)$ baseball team has hired you to design a program that creates a

baseball lineup and position assignment. The lineup $($i$.$e$.,$ the batting order from $1$st to last$)$ will be based on the batting

average of each player. For example, if Joshua has an average of $692$ and Jackson has an average of $459,$ Joshua will be

placed first in the lineup, followed by Jackson.

In terms of the position assignment $($i$.$e$.,$ Joshua plays $1$st base in inning $1,3$rd base in inning $2,$ center field in inning $3,$

etc.$)$ your program must assign the field positions for each defensive player in accordance to the PONY Shetland rules

stated below.

$1.$ The line$-$up should include batting order and player$$s defensive positions for each of the five innings.

$2.$ Each team shall play all players in the field in defensive positions. Additional players, $($short fielders$),$ shall be

positioned in the outfield no closer than $20$ feet to the baseline when the ball is hit and will be considered

outfielders.

$3.$ Each player must be scheduled to play an infield position at least one $(1)$ inning. Catcher will be considered an

infield position. A player may only be scheduled to play catcher a maximum of one $(1)$ inning per game. No

player may play a second inning of infield until every other player has played one inning of infield.

$4.$ A player cannot play the same defensive position for more than one $(1)$ inning per game.

$5.$ A player can only sit out one $(1)$ inning per game.

Software Requirements

$-$ Create a flowchart or pseudo code to establish an algorithm of how to solve this problem.

$-$ Use a two dimensional string array to store the lineup player names and position assignments for each player as seen

above.

$-$ You can use an iterative approach to display the array, but if you are going to use a recursive approach, use a recursive

function to display the names and positions of the lineup and field positions. This recursive function must be a void

function called displayArray that receives a $2$D array, a first index whole number, and a last index whole number. The

void function must use the divide$-$and$-$conquer approach as described in your text.

$-$ You are permitted to create any additional arrays, variables, functions, etc. towards the completion of this project.

Has to contain the 'main' function. Program execution begins and

ends there.

$//$

#include

#include

using namespace std;

struct player $\{$

string name;

int average;

$\}$;

const int TEAM$\_$SIZE $=12$;

const int NUM$\_$INNINGS $=5$;

void displayArray$($string innings$[$TEAM$\_$SIZE$][$NUM$\_$INNINGS $+1])$;

int main$()$

$\{$

$//$ Declarations

player players$[$TEAM$\_$SIZE$]$;

$//$ Get user input

cout $$ "Enter $12$ player names: $"$ endl;

for $($int i $=0$; i $$ TEAM$\_$SIZE; i$++)\{$

cout $$ "What is player $"$ i s name: $"$;

cin $>>$ players$[$i$].$name;

$\}$

cout $$ "Enter the average for each player: $"$ endl;

cout endl;

for $($int i $=0$; i $$ TEAM$\_$SIZE; i$++)\{$

cout $$ "What is $"$ players$[$i$].$name s average: $"$;

cin $>>$ players$[$i$].$average;

$\}$

$//$ The string array used to store the lineup of

$//$ player names and player position assignment

string innings$[$TEAM$\_$SIZE$][$NUM$\_$INNINGS $+1]=\{\{\}\}$;

$//$ Calculate positions

$//$ Display result

displayArray$($innings$)$;

system$("$pause$")$;

return $0$;

$\}$

void displayArray$($string innings$[$TEAM$\_$SIZE$][$NUM$\_$INNINGS $+1])\{$

cout $$ "Game lineup and field positions:" $$ endl;

cout endl;

cout $$ "Name $\backslash$t Inning $1\backslash$t Inning $2\backslash$t Inning $3\backslash$t Inning $4\backslash$t Inning $5"$

endl;

for $($int i $=0$; i $$ TEAM$\_$SIZE; i$++)\{$

for $($int j $=0$; j $$ NUM$\_$INNINGS $+1$; j$++)\{$

printf$("\%-15$s$",$ innings$[$i$][$j$].$c$\_$str$())$;

$\}$

printf$("$

$")$;

$\}$

$\}$