If all elements are distinct we have to check 1st row and 1st column.So complexity will be O(n2)
Here minimum no of comparison could be 1 , because a[0][0] will be minimum always, now we have to check between a[0][1] and a[1][0]
if all elements are not distinct we have to search all elements of the array
So, minimum comparison could be O(1)