Description

Consider the following problem which is similar to the one assignment $3.$

Suppose we model an apartment with ASCII characters. Specifically, a space $$ can be moved

through. An asterisk $*$ is a wall or furniture that cannot be traversed. Assume that $(0,0)$

is the upper lefthand corner. For the sake of simplicity you can assume the apartment is

enclosed in $*$ characters.

Complete the recursive function, recF ill, which to replace all of the $$ characters in the

apartment reachable from the given $($row$,$col$)$ location with $$#$$ characters.

Example:

Starting room:

$**********$

$**$

$********$

$****$

$******$

$***$

$**********$

recFill$($ room, $3,4)$:

$**********$

$*$########$*$

$****$##$****$

$**$##$**$

$****$##$**$

$*$#####$**$

$**********$

recFill$($ room, $3,1)$:

$**********$

$**$

$********$

$*$##$***$

$******$

$***$

$**********$

recFill$($ room, $0,0)$:

$**********$

$**$

$********$

$****$

$******$

$***$

$**********$

$($since you start at a $*)$

$($Unreachable $$ areas should remain unchanged$)$

Continued on the back $,->$

$/*$ recFillRoom

$*$ input: the room to process,

$*$ the row and column of the current location being explored

$*$

$*$ Replace all of the reachable $$ spaces reachable from $($row$,$ col$)$ with $$#$$

$*$

$*$ HINT: You don$$t actually need to know the length$/$width since the

$*$ apartment is fully enclosed in $*$ characters

$*/$

void recFill$($ char$**$ room, int row, int col $)$

$\{$

$/*$ Base cases: $*/$

$/*$ Recursive cases: $*/$

$\}$