What is arraylist?

Arraylist in computer programming is a data structure that behaves like a computer field, but also implements the ability to dynamically growing field size as needed. Unlike the type of internal field data that cannot be changed when performing the program, the field structure may grow and reduce the field size in response to the addition or deletion of the elements. It has a very favorable power profile that allows rapid random access to data collection. However, there are two instances in which it is slower than some other data structures, adding and removing elements from the center of the field. Most object -oriented programming languages ​​have a certain type of implementation of such a list, although they are sometimes called dynamic fields.

Using Arraylist, it provides a program with the ability to access data objects with an index number instead of having to go through the entire data sequence to find the address, which is required, which is required with lists. With the ability to enlarge the size of the field as needed is the greatEven a balanced approach that considers both flexibility and speed. In addition, when the elements are removed from such a list, the size of the field is reduced and the memory space is released.

One of the advantages of using arraylist over some other data structures is that the packaging object is not necessary to contain stored data. In the case of a connected list or hash table, a separate object is usually needed to maintain the technique used to hold and handle the collection. With arraylist, the only necessary information about data objects is the address of the object in memory. This means that when working with this type of list, there will be less directing memory.

The potential problem with the use of arraylist can come from the system of implementation and memory management. Most fields are Alnaje as a consecutive memory location. If you want to use a field of certain size, it must be in a continuous sequence of blocks to layoutEven so much memory. The dynamic field could change the size several times, so memory fragmentation may occur and lead to memory assignment and stopping the stop program.

The power of the arraylist is similar to the performance of the standard field, although the access times are slightly slower because the field is encapsulated in the object. One example in which the dynamic field can slow down dramatically, depending on the implementation, when it is necessary to change the size of the field. This may include copying the current field to a new field that has been assigned a new desired size, causing temporary performance degradation. The same problem can be occurred when adding or removing the element from the center of the list, causing all the following elements to be moved to a new location.