Lower Bound And Upper Bound In One Dimensional Array

Let suppose we have 1 dimensional array:

int A[6]={15,7,11,44,93,20};

here [] is here subsscript is subject

B= base address
W= storage size of one element stored in array (inbyte)
I= subscript of element whose address is to be found
Lb= lower limit/ Lower bound of subscript, if not specified assume 0 (zero).
so address of A[i]=B+w*(1-Lb)

CLICK HERE TO Download This PDF NOTES