LinkedList vs. ArrayList in Java | Data Structures | Collections | List | Java Programming
Hello everyone,
Welcome to ModelMyMind.
The #Java #Collection #Framework enables various data manipulation operations such as storing, searching, sorting, inserting, deleting, and updating data in a data container. The goal here is to enable these processing operations appropriately.
In this video, we'll look at the #linkedlist and #arraylist classes, both of which are collections and implement the #list interface.
In the video on the topic of the 5 concepts you absolutely need to learn when getting started with object-oriented programming,
I emphasized that the topic of #data structures should be part of your curriculum as a programmer.
When it comes to collections, the Java Standard Library offers two well-known List implementations, known as LinkedList and ArrayList.
Since List is an interface, objects of type List cannot be created. We always need a class that implements this List(s) to create an object. Furthermore, since the introduction of generics in Java 1.5, it's been possible to restrict the object type that can be stored in the list.
We'll look at common operations with LinkedLists and ArrayLists. The most common operations are adding, removing, and updating objects (in these data containers).
The respective List implementations have their own characteristics and use cases. A List represents a list of elements of any type in a fixed order, which can be accessed both randomly and sequentially. Duplicate entries are allowed in lists. This allows multiple identical objects to be inserted into a list: this also applies to LinkedLists and ArrayLists.
Stay tuned for the video. Let me know what you think of this tutorial in the comments.
#programming #java #softwareengineer