So long as one is only accessing the elements of an ArrayList, its efficiency is about the same as that of an array. It's only when one begins to insert or remove elements towards the front portion of an ArrayList that its efficiency deteriorates.

True or False?

The implementation of ArrayLists in Java programming language is very similar to the regular arrays. The most significant difference is that arrays are fixed length (Once created, their length cannot be changed) while ArrayList have variable lengths. Also ArrayList provides several methods from the Collections class for easy manipulation of data.

So if the only activity is accessing elements of an Arraylist, then its performance efficiency will not be different from a regular Java Array since their implementations are similar (except for the fixed and variable sizes). But when other complex activities such as insertions and deletions towards the front portion of an ArrayList takes place, its performance reduces.

So long as one is only accessing the elements of an ArrayList, its efficiency is about the same as that of an array. It's only when one begins to insert or remove elements towards the front portion of an ArrayList that its efficiency deteriorates. True or False?

Respuesta :

Otras preguntas

So long as one is only accessing the elements of an ArrayList, its efficiency is about the same as that of an array. It's only when one begins to insert or remove elements towards the front portion of an ArrayList that its efficiency deteriorates.

True or False?