1. fetch : obtains the data stored in the element of the array whose state is A and whose index is iM
2. store : the array state that results by setting the value of that element to V in array state A

Judy array is a complex but very fast associative array data structure for storing and looking up values using integer or string keys. Unlike normal arrays, Judy arrays may be sparse; that is, they may have large ranges of unassigned indices. Due to its cache optimizations, Judy arrays are fast, sometimes even faster than a hash table, especially for very big datasets.

The array name is like a pointer variable in that the array name by itself references the address of the first element of the array.

The benefit of using arrays of pointers is that you can use a for loop to step through each element of the array to access memory addresses that are assigned to the array. This must be done in order to efficiently access and reorder the values stored in memory.

The elements of an array are stored sequentially in memory (one after another). Each element of the array is identified by a unique index.