What is the Big O notation for the following algorithm?

ctr $=0$

while $($ctr $<$ N$)\{$

myAge $=$ ctr

val $=$ ctr $+1$

while $($val $<$ N$)\{$

if $($ageOfPeople$[$val$]<$ ageOfPeople$[$myAge$])$

myAge $=$ val

$$

Question $251$ pts

$$

Question $261$ pts

$++$val

$\}$

tempList $=$ ageOfPeople$[$ctr$]$

ageOfPeople $[$ctr$]=$ ageOfPeople $[$myAge$]$

ageOfPeople $[$myAge$]=$ tempList

$++$ctr

$\}$

O$(1)$