What parts does the structure of memory for an array with primitive elements consist of, and how is it organized?

In Java, an array of primitive elements consists of several parts:

• Object header, which contains metadata such as a reference to the class and garbage collection data.
• Length field, which stores the number of elements.
• The data itself — a sequence of primitive type elements stored contiguously in memory.

The memory organization is such that after the header and length field, the array elements follow consecutively, enabling quick index-based access by calculating the address as base address + index * element size.