What is the purpose of the following algorithm?

boolean found $=$ false;

int $i=0$;

while $(!$found && $i$ str$.$length$())$

$\{$

ch $=$ str $*$ charAt $(i)$;

if $)=={(}^{\text{'}}-{?}^{\text{'}}$

$\{$

found $=$ true;

$\}$

else

$\{$

i$++$;

$\}$

$\}$

counting matches

finding the first match

comparing adjacent values

prompting until a match is found