Cache-Friendly Matrix Processing via Linear Memory Stride Traversal

#include <stdio.h>
 
#define ROWS 4
#define COLS 4
 
long sum_matrix_row_major(const int matrix[ROWS][COLS]) {
    long total = 0;
    for (int r = 0; r < ROWS; r++) {
        for (int c = 0; c < COLS; c++) {
            total += matrix[r][c];
        }
    }
    return total;
}
 
int main(void) {
    int data[ROWS][COLS] = {
        {1, 2, 3, 4},
        {5, 6, 7, 8},
        {9, 10, 11, 12},
        {13, 14, 15, 16}
    };
    printf("Sum: %ld\n", sum_matrix_row_major(data));
    return 0;
}