How to count the number of sorted rows in either increasing or decreasing order in a matrix using C++

1 Answer

0 votes
#include <iostream>

#define ROWS 4
#define COLS 5

int sortedCount(int mat[][COLS], int rows, int cols) {
    int result = 0;

    // Check for strictly increasing rows
    for (int i = 0; i < rows; i++) {
        int j;
        for (j = 0; j < cols - 1; j++) {
            if (mat[i][j + 1] <= mat[i][j]) {
                break;
            }
        }
        if (j == cols - 1) {
            result++;
        }
    }

    // Check for strictly decreasing rows
    for (int i = 0; i < rows; i++) {
        int j;
        for (j = cols - 1; j > 0; j--) {
            if (mat[i][j - 1] <= mat[i][j]) {
                break;
            }
        }
        if (cols > 1 && j == 0) {
            result++;
        }
    }

    return result;
}

int main() {
    int matrix[][COLS] = {
        {1, 2, 3, 4, 5},
        {2, 3, 1, 8, 7},
        {8, 7, 6, 5, 4},
        {5, 7, 8, 9, 10}
    };

    std::cout << "Number of sorted rows: " << sortedCount(matrix, ROWS, COLS);
}


/*
run:

Number of sorted rows: 3

*/

 



answered Oct 1, 2025 by avibootz
...