What is the advantage of using an array over a linked list when performing add and remove operations?

Arrays provide quick access to elements by index (O(1)), which speeds up read operations. However, adding and removing elements in the middle of an array requires shifting elements, which takes O(n).

Linked lists allow for quick addition and removal of elements anywhere (O(1)), if there is a pointer to the desired node, but access by index takes O(n).

The advantage of arrays when adding and removing is evident when operations occur at the end of the array (for example, adding to a dynamic array), where these operations are performed in amortized O(1), which is faster than in a linked list, where memory must be allocated for a new node.