Select the asymptotic worst$-$case time complexity of the following algorithm:

Algorithm

Input:

$a_1,a_2,$dots,$a_n,$ a sequence of numbers

$n,$ the length of the sequence

$x,$ a number

Output: $??$

For $i$:$=1$ to $n-1$

For $j$:$=i+1$ to $n$

$If(|a_i-a_j|>0)$ Return$(True)$

End$-$for

End$-$for

Return$($ "False" $)$

$(1)$

$(n)$

$(n^2)$

$(n^3)$

None of these