Draw contiguous storage without guessing sizeof(int)

A laboratory stores four integer readings from consecutive hours. Explain why one array is more suitable than four separately named variables for indexed traversal. Draw its element order and give the byte-address formula for reading[i], using B for the address of reading[0] and S for sizeof(int). Give offsets for i=0,1,2,3, the total array size in terms of S, and the exact output of the program. Explain why reading[4] is not an extra reading. Do not assume an int occupies four bytes.

#include <stdio.h>
int main(void) {
    int reading[4] = {12, 15, 11, 18};
    size_t count = sizeof reading / sizeof reading[0];
    for (size_t i = 0; i < count; ++i) {
        printf("index=%zu value=%d offset=%zu elements\n", i, reading[i], i);
    }
    printf("count=%zu\n", count);
    return 0;
}

