Array vs Linked List: Time Complexity

What are the time complexities of arrays and linked lists?

Arrays have O(1) time complexity for access and O(n) for insertion/deletion, while linked lists have O(n) for access and O(1) for insertion/deletion.

Why is accessing an element in a linked list slower than in an array?

Accessing an element in a linked list requires traversing from the head to the desired node, which takes O(n) time, while arrays allow direct access.

In what scenarios would you prefer a linked list over an array?

Linked lists are preferred when frequent insertions and deletions are needed, as they can be done in O(1) time without resizing.

Can you give an example of a real-world application for each?

Arrays are often used in applications requiring fast access, like image processing, while linked lists are used in dynamic memory allocation, like managing playlists.