int main$()$

$\{$

do

$\{$

system$("$cls$")$;

cout $<<"$

$\backslash$tCMPR$121$: Chapter $9$ Pointer $-$ assignments by Prof Q $(2-14-2024)"$;

cout $<<"$

$\backslash$t$"<<$ string$(80,$ char$(205))$;

cout $<<"$

$\backslash$t $3.$ Drop the Lowest Score";

cout $<<"$

$\backslash$t $6.$ Case Study Modification #$1"$;

cout $<<"$

$\backslash$t $7.$ Case Study Modification #$2"$;

cout $<<"$

$\backslash$t $9.$ Median Function";

cout $<<"$

$\backslash$t$10.$ Reverse Array";

cout $<<"$

$\backslash$t$11.$ Array Expander";

cout $<<"$

$\backslash$t$12.$ Element Shifter";

cout $<<"$

$\backslash$t$"<<$ string$(80,$ char$(196))$;

cout $<<"$

$\backslash$t $0.$ Exit";

cout $<<"$

$\backslash$t$"<<$ string$(80,$ char$(205))$;

cout $<<"$

$"$;

switch $($inputInteger$("\backslash$tOption: $",0,12))$

$\{$

case $0$: exit$(0)$;

case $3$: challenge$3()$; break;

$//$ case $6$: challenge$6()$; break;

$//$ case $7$: challenge$7()$; break;

$//$ case $9$: challenge$9()$; break;

$//$ case $10$: challenge$10()$; break;

$//$ case $11$: challenge$11()$; break;

$//$ case $12$: challenge$12()$; break;

default: cout $<<"$

$\backslash$tERROR: Invalid option.

$"$;

$\}$

system$("$pause$")$;

$\}$ while $($true$)$;

return $0$;

$\}$

void challenge$3()$

$\{$

int size $=$ inputInteger$("$

Enter the size of the dynamic array: $",$ true$)$;

double$*$ scores $=$ new double$[$size$]$;

srand$($time$(0))$;

int sum $=0$;

for $($int i $=0$; i $<$ size; i$++)$

$\{$

$*($scores$+$i$)=$ rand$()\%100+1$;

cout $<<*($scores $+$ i$)<<\text{'}$

$\text{'}$;

sum $+=*($scores $+$ i$)$;

$\}$

$//$no ascending order sort

$//$not eliminate the lowest score from the array

cout $<<"$

Average: $"<<$ static$\_$cast$($sum$)/$size $<<\text{'}$

$\text{'}$;

delete$[]$ scores;

$\}$