Avatar of jrbarbati

jrbarbati's solution

to Saddle Points in the C Track

Published at Sep 25 2019 · 0 comments
Instructions
Test suite
Solution

Detect saddle points in a matrix.

So say you have a matrix like so:

    1  2  3
  |---------
1 | 9  8  7
2 | 5  3  2     <--- saddle point at column 1, row 2, with value 5
3 | 6  6  7

It has a saddle point at column 1, row 2.

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.

The matrix can have a different number of rows and columns (Non square).

Note that you may find other definitions of matrix saddle points online, but the tests for this exercise follow the above unambiguous definition.

Getting Started

Make sure you have read the "Guides" section of the C track on the Exercism site. This covers the basic information on setting up the development environment expected by the exercises.

Passing the Tests

Get the first test compiling, linking and passing by following the three rules of test-driven development.

The included makefile can be used to create and run the tests using the test task.

make test

Create just the functions you need to satisfy any compiler errors and get the test to fail. Then write just enough code to get the test to pass. Once you've done that, move onto the next test.

As you progress through the tests, take the time to refactor your implementation for readability and expressiveness and then go on to the next test.

Try to use standard C99 facilities in preference to writing your own low-level algorithms or facilities by hand.

Source

J Dalbey's Programming Practice problems 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.

test_saddle_points.c

#include "vendor/unity.h"
#include "../src/saddle_points.h"
#include <stdlib.h>
#include <stdbool.h>

void setUp(void)
{
}

void tearDown(void)
{
}

static void check_count(size_t expected, size_t actual)
{
   TEST_ASSERT_EQUAL_UINT64(expected, actual);
}

static void check_points(size_t count, saddle_point_t expected[],
                         saddle_point_t actual[])
{
   // assumes array counts match
   for (size_t i = 0; i < count; ++i) {
      bool point_found = false;
      for (size_t j = 0; j < count; ++j) {
         if (expected[i].row == actual[j].row
             && expected[i].column == actual[j].column) {
            point_found = true;
            break;
         }
      }
      if (!point_found)
         TEST_FAIL();
   }
}

static void test_single_saddle_point(void)
{
   uint8_t matrix[3][3] = {
      {9, 8, 7},
      {5, 3, 2},
      {6, 6, 7}
   };

   size_t expected_count = 1;
   saddle_point_t expected_points[] = { {2, 1} };
   saddle_points_t *actual = saddle_points(3, 3, matrix);
   check_count(expected_count, actual->count);
   check_points(expected_count, expected_points, actual->points);
   free_saddle_points(actual);
}

static void test_empty_matrix_has_no_saddle_points(void)
{
   TEST_IGNORE();               // delete this line to run test
   size_t expected_count = 0;
   saddle_points_t *actual = saddle_points(0, 0, NULL);
   check_count(expected_count, actual->count);
   free_saddle_points(actual);
}

static void test_lack_of_saddle_points_when_there_are_none(void)
{
   TEST_IGNORE();
   uint8_t matrix[3][3] = {
      {1, 2, 3},
      {3, 1, 2},
      {2, 3, 1}
   };

   size_t expected_count = 0;
   saddle_points_t *actual = saddle_points(3, 3, matrix);
   check_count(expected_count, actual->count);
   free_saddle_points(actual);
}

static void test_multiple_saddle_points_in_a_column(void)
{
   TEST_IGNORE();
   uint8_t matrix[3][3] = {
      {4, 5, 4},
      {3, 5, 5},
      {1, 5, 4}
   };

   size_t expected_count = 3;
   saddle_point_t expected_points[] = { {1, 2}, {2, 2}, {3, 2} };
   saddle_points_t *actual = saddle_points(3, 3, matrix);
   check_count(expected_count, actual->count);
   check_points(expected_count, expected_points, actual->points);
   free_saddle_points(actual);
}

static void test_multiple_saddle_points_in_a_row(void)
{
   TEST_IGNORE();
   uint8_t matrix[3][3] = {
      {6, 7, 8},
      {5, 5, 5},
      {7, 5, 6}
   };

   size_t expected_count = 3;
   saddle_point_t expected_points[] = { {2, 1}, {2, 2}, {2, 3} };
   saddle_points_t *actual = saddle_points(3, 3, matrix);
   check_count(expected_count, actual->count);
   check_points(expected_count, expected_points, actual->points);
   free_saddle_points(actual);
}

static void test_saddle_point_in_bottom_right_corner(void)
{
   TEST_IGNORE();
   uint8_t matrix[3][3] = {
      {8, 7, 9},
      {6, 7, 6},
      {3, 2, 5}
   };

   size_t expected_count = 1;
   saddle_point_t expected_points[] = { {3, 3} };
   saddle_points_t *actual = saddle_points(3, 3, matrix);
   check_count(expected_count, actual->count);
   check_points(expected_count, expected_points, actual->points);
   free_saddle_points(actual);
}

static void test_saddle_points_in_non_square_matrix(void)
{
   TEST_IGNORE();
   uint8_t matrix[2][3] = {
      {3, 1, 3},
      {3, 2, 4}
   };

   size_t expected_count = 2;
   saddle_point_t expected_points[] = { {1, 3}, {1, 1} };
   saddle_points_t *actual = saddle_points(2, 3, matrix);
   check_count(expected_count, actual->count);
   check_points(expected_count, expected_points, actual->points);
   free_saddle_points(actual);
}

static void
    test_saddle_points_in_single_column_matrix_are_those_with_the_minimum_value
    (void) {
   TEST_IGNORE();
   uint8_t matrix[4][1] = {
      {2},
      {1},
      {4},
      {1}
   };

   size_t expected_count = 2;
   saddle_point_t expected_points[] = { {2, 1}, {4, 1} };
   saddle_points_t *actual = saddle_points(4, 1, matrix);
   check_count(expected_count, actual->count);
   check_points(expected_count, expected_points, actual->points);
   free_saddle_points(actual);
}

static void
test_saddle_points_in_single_row_matrix_are_those_with_the_maximum_value(void)
{
   TEST_IGNORE();
   uint8_t matrix[1][4] = {
      {2, 5, 3, 5}
   };

   size_t expected_count = 2;
   saddle_point_t expected_points[] = { {1, 2}, {1, 4} };
   saddle_points_t *actual = saddle_points(1, 4, matrix);
   check_count(expected_count, actual->count);
   check_points(expected_count, expected_points, actual->points);
   free_saddle_points(actual);
}

int main(void)
{
   UnityBegin("test/test_saddle_points.c");

   RUN_TEST(test_single_saddle_point);
   RUN_TEST(test_empty_matrix_has_no_saddle_points);
   RUN_TEST(test_lack_of_saddle_points_when_there_are_none);
   RUN_TEST(test_multiple_saddle_points_in_a_column);
   RUN_TEST(test_multiple_saddle_points_in_a_row);
   RUN_TEST(test_saddle_point_in_bottom_right_corner);
   RUN_TEST(test_saddle_points_in_non_square_matrix);
   RUN_TEST
       (test_saddle_points_in_single_column_matrix_are_those_with_the_minimum_value);
   RUN_TEST
       (test_saddle_points_in_single_row_matrix_are_those_with_the_maximum_value);

   return UnityEnd();
}

src/saddle_points.h

#ifndef SADDLE_POINTS_H
#define SADDLE_POINTS_H

#include <stdlib.h>

typedef struct saddle_point
{
	int row;
	int column;
} saddle_point_t;


typedef struct saddle_points
{
	int count;
	saddle_point_t *points;
} saddle_points_t;

saddle_points_t *saddlePoints(size_t rows, size_t cols, uint8_t matrix[rows][cols]);

#endif

src/saddle_points.C

#include "saddle_points.h"
#include <stdio.h>

int is_saddle_point(size_t row, size_t col, size_t rows, size_t cols, uint8_t matrix[rows][cols]);

saddle_points_t *saddlePoints(size_t rows, size_t cols, uint8_t matrix[rows][cols])
{
	saddle_points_t *saddle_points = calloc(1, sizeof(saddle_points_t));
	saddle_points->points = calloc(rows * cols, sizeof(saddle_point_t));
	size_t row, col;

	if (matrix == NULL)
		return saddle_points;

	for (row = 0; row < rows; row++)
		for (col = 0; col < cols; col++)
			if (is_saddle_point(row, col, rows, cols, matrix))
			{
				saddle_points->points[saddle_points->count].row = row + 1;
				saddle_points->points[saddle_points->count++].column = col + 1;
			}

	return saddle_points;
}

int is_saddle_point(size_t row, size_t col, size_t rows, size_t cols, uint8_t matrix[rows][cols])
{
	size_t i;
	
	for (i = 0; i < cols; i++)
		if (matrix[row][col] < matrix[row][i])
			return 0;
	
	for (i = 0; i < rows; i++)
		if (matrix[row][col] > matrix[i][col])
			return 0;
	
	return 1;
}

Community comments

Find this solution interesting? Ask the author a question to learn more.

What can you learn from this solution?

A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

  • What compromises have been made?
  • Are there new concepts here that you could read more about to improve your understanding?