Операторы ветвления в языке С

   int nomin = 1; 
    int min1 = arr1[0]; 
 
    // check all values in arr1 
    for (int i = 0; i < A1MAX; i++) { 
        // current value we're going to test 
        int val = arr1[i]; 
 
        // check value if it's a _new_ minimum or we do _not_ yet have a minimum 
        if ((val < min1) || nomin) { 
            // scan all elements of arr2, looking for a match to the current 
            // arr1 value 
            int match = 0; 
            for (int j = 0; j < A2MAX; j++) { 
                match = (val == arr2[j]); 
                if (match) 
                    break; 
            } 
 
            // if the current value is _not_ in arr2, we have a new minimum 
            if (! match) { 
                min1 = val; 
                nomin = 0; 
            } 
        } 
    } 
 
    if (nomin) 
        printf("there are no elements in arr1 that are not in arr2\n"); 
    else 
        printf("the minimum element in arr1 not in arr2 is: %d\n",min1); 
 
    return nomin; 
} 

 (scanf("%d", &arr1[i]) != 1) 

 if ((val < min1) || nomin) 

  if (match) 

    if (! match)