Answer
procedure negative $(a_1, a_2, ..., a_n:$ a set of $n$ integers $)$
count $:=0$
for $i:=1$ to $n$
$\space\space\space$if $a_i < 0$ then count $:=$ count+ $1$
return count;
{count is the number of negative integers}
Work Step by Step
The algorithm first takes in a list of integers and returns the count of negative numbers. It does this by first initializing a counter to $0$ and then iterating over every element of the list. If the element is less than $0$, the counter is incremented by $1$. Finally, this counter is returned
