I’ve been given the challenge to code np.argmin without numpy .
I’ve been thinking hard for about a day..
I have no idea whether I should use a for statement,
an if statement, a while statement, or another function..
First, I thought about how to express it with an inequality sign to distinguish between cases.
using the if statement
a[0,0] – a[0,1] > 0
a[0,0] – a[0,1] < 0
I tried to write the code by dividing the two cases.
There were too many cases, so I stopped.
Couldn’t it be done with an If statement?
We know that the argmin method represents the address of a pointer as an array value.
What is in the screen capture is what I arbitrarily input as a two-dimensional list.
Because the task is limited to receiving a two-dimensional list as input
I thought that the directions of axis=0 and axis=1 are fixed.
Then axis=0 freezes the column and compares row to row
Is it okay to think that axis=1 freezes rows and compares columns to columns?
After receiving an arbitrary two-dimensional list, ndarray is
I thought it would be in the form of a matrix of the form ixj.
Then, if you use a.shape, the output value is output as (i , j).
How can we extract i and j here?
It’s really hard to think about all day long.
Any hints would be appreciated.