Efficiency operations for linear data structures

Accessing by index for ARRAYS

O(1)

Search in an unsorted ARRAY

O(n)

Insert an element at the end of an ARRAY

O(1)

Insert an element at an index of an ARRAY

O(n)

Deleting an element at an index of an ARRAY

O(n)

Updating an element by index in an ARRAY

O(1)

Get or set an element by index of an ARRAYLIST

O(1)

Add an element at the end of an ARRAYLIST

O(1)

Insert an element by index of an ARRAYLIST

O(n)

Remove an element by index in an ARRAYLIST

O(n)

Access an element by index of a LINKEDLIST

O(n)

Add an element at the front of a LINKEDLIST

O(1)

Add an element at the end of a LINKEDLIST

O(1)

Insert/remove an element of a LINKEDLIST

O(1)

Insert/remove an element by index of a LINKEDLIST

O(n)

Search for an element in a LINKEDLIST

O(n)

Pushing an element in a STACK

O(1)

Popping an element in a STACK

O(1)

Peeking at an element in a STACK

O(1)

Searching for an element in a STACK

O(n)

Enqueueing an element in a QUEUE

O(1)

Deqeueing an element in a QUEUE

O(1)

Peeking at an element in a QUEUE

O(1)

Searching for an element in a QUEUE

O(n)