0| Array | Linked List |
| Accessing element is easy. | Accessing element is difficult compare to Array. |
| Easy to use. | Difficult to use. |
| Memory is Fixed size. | Memory is variable size. |
| If all the memories are not utilised, unused memory will be present. | Memory will be allocated as much as required. No unused memory available. |
| As there is no pointer variable, no extra memory is required. | Extra bytes of memory is required for Pointer varialble. |
| Memory will be available contiguously. | Memory will be scattered. |
| In case of bigger array, large chunks of contiguous memory block is required. | Multiple small chunks of memory block is enough. |
| Inserting / Deleting / Modifying an element is very easy. | Inserting / Deleting / Modifying an element is difficult. |
