What is an array, and how does it differ from other data structures?
Answer (2)
An array is a collection of items stored in contiguous memory locations and accessible via an index or key. It typically holds elements of the same data type. Arrays differ from other data structures like lists or linked lists by their fixed size (in many languages) and by offering fast, constant-time access to elements via indexing, but less flexibility in resizing or insertion/deletion compared to linked structures.
An array is a collection of elements stored in contiguous memory locations, accessed using an index. It differs from other data structures because it has a fixed size, allows fast random access, and stores elements of the same data type, unlike lists, stacks, or linked structures that can be more flexible but slower to access.
