Arrays vs. Linked Lists..
I am software developer based out of Coimbatore, IN. I try to learn old things and new things on a daily basis.
We are discussing data structures[DS] already! 😬.
When it comes to DS, Arrays and Linked Lists are core concepts of it. Have you ever looked at the differences they possess? Or do you know on what basis they differ from each other?
Well, the differences are as follows,
Size - Arrays are fixed in size, whereas linked lists are dynamic in size.
Storage - Arrays are stored in contiguous locations, whereas linked lists are stored in non-contiguous locations called nodes.
Memory Allocation - Memory allocation happens at the compile time for Arrays and at the run time for linked lists.
Insertion and Deletion - Insertion and deletion are comparatively slower for Arrays, whereas it is comparatively faster for linked lists.
These are only a few differences between the Arrays and Linked Lists to get started with. Hopefully, we shall have a writing covering these concepts in detail.
Comment down your opinion on this [well! a short writing I would say] post. 😉
Cheers! Have a good day YOU!!
