Orion

Array

Definition:

Array is a linear data structure where elements are stored at contiguous memory locations.
It allows storing multiple elements of the same data type using a single variable name.
Each element can be accessed directly using its index (starting from 0).

Working:

Array stores data in a continuous memory block.
Each element is accessed using an index: arr[index].
Insertion/Deletion at the end is easy, but at the beginning/middle requires shifting elements.
Efficient for random access, but costly for frequent insertions/deletions.

Time Complexity:

Access (Read): O(1)
Search: O(n)
Insertion: O(n) (worst case, when inserting at beginning)
Deletion: O(n) (worst case, when deleting from beginning)

Space Complexity:

O(n) (to store n elements)

Enter initial array (comma-separated):

Visited Steps:

Code Snippet: