python读取二维数组的行列数,numpy：获取二维数组最小值的列和行索引

For example,

x = array([[1,2,3],[3,2,5],[9,0,2]])

some_func(x) gives (2,1)

I know one can do it by a custom function:

def find_min_idx(x):

k = x.argmin()

ncol = x.shape[1]

return k/ncol, k%ncol

However, I am wondering if there's a numpy built-in function that does this faster.

Thanks.

EDIT: thanks for the answers. I tested their speeds as follows:

%timeit np.unravel_index(x.argmin(), x.shape)

#100000 loops, best of 3: 4.67 µs per loop

%timeit np.where(x==x.min())

#100000 loops, best of 3: 12.7 µs per loop

%timeit find_min_idx(x) # this is using the custom function above

#100000 loops, best of 3: 2.44 µs per loop

Seems the custom function is actually faster than unravel_index() and where(). unravel_index() does similar things as the