Blog Post Number Five
Unabia, Mary Faith B.
April 14, 2024
My understanding of ArrayList and Vector in the context of C is quite shaky. I grasp their
fundamental concepts, including dynamic memory management, array resizing, and efficient element
access. These data structures offer flexibility and efficiency, making them valuable tools for managing
collections of data in C programming.
LinkedList, on the other hand, is a different beast altogether. Implemented as a collection of nodes
with each node containing data and a pointer to the next node, LinkedList offers advantages like
efficient insertion and deletion at any position. However, it comes with the trade-off of slower random
access due to its sequential nature.
I find LinkedList in C to be a bit more challenging to grasp compared to ArrayList and Vector.
The intricacies of managing pointers, ensuring proper node linkage, and avoiding memory leaks require
meticulous attention and understanding. While I comprehend the fundamental concepts of LinkedList,
such as node traversal and basic operations, I sometimes face challenges in optimizing performance
and handling edge cases effectively.
(made using Latex)