Sha256: f9b7f1a3b010f5edaacfb818a92a41549dd7084e6e244aab2fe8bf6d07d9ab60
Contents?: true
Size: 1.44 KB
Versions: 68
Compression:
Stored size: 1.44 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.
## Setup
Go through the setup instructions for ECMAScript to
install the necessary dependencies:
http://exercism.io/languages/ecmascript
## Requirements
Install assignment dependencies:
```bash
$ npm install
```
## Making the test suite pass
Execute the tests with:
```bash
$ npm test
```
In the test suites all tests but the first have been skipped.
Once you get a test passing, you can enable the next one by
changing `xtest` to `test`.
## 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
68 entries across 68 versions & 1 rubygems