C++: Array vs Linked Lists

What are the main differences between arrays and linked lists in C++?

Arrays are fixed-size and stored in contiguous memory, while linked lists are dynamic and consist of nodes connected by pointers.

Which one is more efficient for inserting and deleting elements?

Linked lists are generally more efficient for insertions and deletions since they don't require shifting elements like arrays do.

What about memory usage? Which one is better?

Arrays can waste memory if not fully utilized, while linked lists use memory for pointers, which can add overhead.

Can you give an example of when to use each?

Use arrays for fixed-size collections and quick access, and linked lists for dynamic collections where frequent insertions/deletions occur.