Consider the following code snippet:

int count $=0$;

int targetVal $=70$;

for $($int i $=0$; i $$ arr.length; i$++)$

$\{$

if $($arr$[$i$]>=$ targetVal$)$

$\{$

count$++$;

$\}$

$\}$

This code is an example of an $O(n)$ algorithm.

True

False