Given a matrix of m*n size, the task is to count all the rows in a matrix that are sorted either in strictly increasing order or in strictly decreasing order?

CountSortedRows.c

#include<stdio.h>

int checkSort(int v[101],int c);
int main()
{
	int T,
	    i,j,mat[101][101],rows,cols;
	
	scanf("%d", &T);
	while(T--) {
	
	      //read the num of rows and cols
	      scanf("%d %d", &rows, &cols);         
	      
	      //read the matrix
	      for(i = 0; i < rows; i++) {
	          
	          for(j = 0; j < cols; j++) {
	              
	              scanf("%d", &mat[i][j]);
	          }
	      }
	      
	      int count = 0;
	      
	      for(i = 0; i < rows; i++) {
	          
	          int r = checkSort(mat[i],cols);
	          if(r == 1) count++;
	      }
	      
	      printf("%d\n", count);
	      
	      
	}
	return 0;
};

int checkSort(int vec[], int cols) {
    
    int i, a = 0, b = 0;
    
    for(i = 0; i < cols - 1; i++ ){
        if(vec[i] < vec[i + 1]) a++;    
        if(vec[i] > vec[i + 1]) b++;
    }
    if(a+1 == cols || b+1 == cols) return 1;
       else  
                               return 0;
};