Explanation for below query

[abhipujari]

I have this code from a project and I am not sure why J is set to n-2 in for loop for Checks forward
Please help

#include <stdio.h>
#include <math.h>

int main()
{
    int test;
   
    printf("Enter the number of tests: ");
    scanf("%d", &test);

    for (int a=0; a < test; a++) {
        int n;
        int pos[10];
        printf("\n\nTest Number %d:", a+1);
        printf("\nEnter number of people: ");
        scanf("%d", &n);
       
        for (int i=0; i<n; i++)
        {
            printf("\n Enter position of %d: ", i+1);
            scanf("%d", &pos[i]);
        }
       
        int min = n, max = 1, count;

        for (int i=0; i<n; i++) {
            count=1;
            //checks forward
            for (int j=i; j<=n-2; j++) {
                if (abs(pos[j]-pos[j+1]) <=2)
                    count++;          
                else
                    break;
            }
            //checks backward
            for (int k=i; k>=1; k--) {
                if (abs(pos[k]-pos[k-1]) <=2)
                    count++;
                else
                    break;
            }
           
            if(count < min)
                min = count;
            if(count > max)
                max = count;
        }
       
        printf("\nMinimum: %d \nMaximum: %d", min, max);
    }
    return 0;
}

 

[Deleted member 2829]

It sure looks as if it ought to be n-1. But then I don't know what exactly this code is trying to achieve. Whatever the purpose, I wonder if 3 loops are really necessary. Does it actually work as it should or not ?