单选题：Given a 2-dimensional array A of size $$N\times N$$. The best d

Given a 2-dimensional array A of size $$N\times N$$.  The best description of the time complexity for finding the largest entry without changing the array is:



A.$$O(N^2)$$
B.$$O(NlogN)$$
C.$$O(N)$$
D.$$O(N^2 logN)$$


答案：A