# Question: a saddle element of a two dimensional array is defined...

###### Question details

A saddle element of a two dimensional array is defined as the smallest in the row and largest in the column, to which it belongs. write an algorithm to determine the location of all saddle elements existing in the array. What is the time complexity of your algorithm?