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

Given a 2-dimensional array A of size $$N\times N$$. The time complexity for finding the largest entry without changing the array is: @[A](2)

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



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


答案：A