<P> An Iliffe vector is an alternative to a multidimensional array structure . It uses a one - dimensional array of references to arrays of one dimension less . For two dimensions , in particular , this alternative structure would be a vector of pointers to vectors , one for each row . Thus an element in row i and column j of an array A would be accessed by double indexing ( A ( i ) ( j ) in typical notation ) . This alternative structure allows jagged arrays , where each row may have a different size -- or , in general , where the valid range of each index depends on the values of all preceding indices . It also saves one multiplication ( by the column address increment ) replacing it by a bit shift ( to index the vector of row pointers ) and one extra memory access ( fetching the row address ) , which may be worthwhile in some architectures . </P>
<P> An Iliffe vector is an alternative to a multidimensional array structure . It uses a one - dimensional array of references to arrays of one dimension less . For two dimensions , in particular , this alternative structure would be a vector of pointers to vectors , one for each row . Thus an element in row i and column j of an array A would be accessed by double indexing ( A ( i ) ( j ) in typical notation ) . This alternative structure allows jagged arrays , where each row may have a different size -- or , in general , where the valid range of each index depends on the values of all preceding indices . It also saves one multiplication ( by the column address increment ) replacing it by a bit shift ( to index the vector of row pointers ) and one extra memory access ( fetching the row address ) , which may be worthwhile in some architectures . </P>
example of one dimensional array in data structure
example of one dimensional array in data structure
Iliffe vector
Iliffe vector