Arrays
collection of similar types of data
single, pre allocated chunk of contiguous elements (all of the same type), fixed in size and location
static in nature; once memory is allocated, it cannot be resized or freed dynamically
most common type of arrays, where elements are stored in a linear order
arrays with more than one dimension
Efficient Access: fast and has constant time complexity
Memory Management: have fixed size, which makes memory management straightforward and predictable
Data Organization: structured manner, making it easier to manage related elements
Fixed Size: leads to memory waste if the size is overestimated or insufficient if underestimated
Type Homogeneity: can only store elements of the same data type, which may require additional handling for mixed data types
Insertion and Deletion: can be costly as it may require shifting elements