Sha256: 433f15cb138620b48fd8b6190f6d0a09c1d16e63ae9d8183c23d5a7728ade34f
Contents?: true
Size: 1.4 KB
Versions: 74
Compression:
Stored size: 1.4 KB
Contents
# Saddle Points
Detect saddle points in a matrix.
So say you have a matrix like so:
```text
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 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.
The Scala exercises assume an SBT project scheme. The exercise solution source
should be placed within the exercise directory/src/main/scala. The exercise
unit tests can be found within the exercise directory/src/test/scala.
To run the tests simply run the command `sbt test` in the exercise directory.
For more detailed info about the Scala track see the [help
page](http://exercism.io/languages/scala).
## Source
J Dalbey's Programming Practice problems [http://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html](http://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html)
## Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
74 entries across 74 versions & 1 rubygems