🚀 Array Visualization

# Array Data Structure Overview

An array is a sequential collection of elements stored in contiguous memory locations.

# Operations :

1. Insertion (at the end):
   - Description: Adds an element to the end of the array.
   - Syntax: void insert(const T& value);

2. Deletion (at a specific index):
   - Description: Removes an element from the array at the specified index.
   - Syntax: void remove(int index);

3. Access (by index):
   - Description: Retrieves the element at the specified index.
   - Syntax: T& getElement(int index);

4. Search:
   - Description: Searches for a specific element in the array.
   - Syntax: int search(const T& target);

5. Size:
   - Description: Returns the number of elements in the array.
   - Syntax: int size() const;

6. Empty:
   - Description: Checks if the array is empty.
   - Syntax: bool isEmpty() const;

Overflow: Adding to a full array may require resizing the array, which can be costly in terms of time and memory.

Underflow: Removing from an empty array may cause errors or unexpected behavior.