Sha256: 9432e9de9bfc7d140086d5a3e4e518fdd49a93bcea469ae717313608812c3a85
Contents?: true
Size: 631 Bytes
Versions: 174
Compression:
Stored size: 631 Bytes
Contents
So say you have a matrix like so:
```plain
0 1 2
|---------
0 | 9 8 7
1 | 5 3 2 <--- saddle point at (1,0)
2 | 6 6 7
```
It has a saddle point at (1, 0).
It's called a "saddle point" because it is greater than or equal to
every element in its row and the less than or equal to every element in
its column.
A matrix may have zero or more saddle points.
Your code should be able to provide the (possibly empty) list of all the
saddle points for any given matrix.
Note that you may find other definitions of matrix saddle points online,
but the tests for this exercise follow the above unambiguous definition.
Version data entries
174 entries across 174 versions & 1 rubygems