General Array Linked Dynamic Inserting Deleting Element Expensive

How is an Array different from Linked List?   

Mustakim raheem
@[email protected] | Updated 19 Dec. 2018

The size of the arrays is fixed, Linked Lists are Dynamic in size. Inserting and deleting a new element in an array of elements is expensive, Whereas both insertion and deletion can easily be done in Linked Lists. Random access is not allowed in Linked Listed. Extra memory space for a pointer is required with each element of the Linked list.