Consider the following pseudocode for a function that operates on an $\textsf{N}$ element array $\textsf{A[1],A[2]},\dots,\textsf{A[N]}$ of integers.
function mystery (A[1...N])
{
int i,j,position,tmp;
for i=1 to N
{
position=i;
for j=i+1 to N
{
if(A[j]<A[position])
{
position=j;
}
}
tmp=A[i];
A[i]=A[position];
A[position]=tmp;
}
}
If $\textsf{N = 100,}$ how many times is the comparison $\textsf{A[j] < A[position]}$ checked?
