Answer Posted / hrindows@gmail.com
The Big-O notation depicts the performance of an algorithm as the number of elements in ArrayList. A developer can use Big-O notation to choose the collection implementation. It is based on performance, time, and memory.
For example, ArrayList get(index i) is a method to perform a constant-time operation. It does not depend on the total number of elements available in the list. Therefore, the performance in Big-O notation is O(1).
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the difference between and ?
what is recursion in java
What are the 8 primitive data types in java?
What is meant by class and object in java?
What is the use of protected in java?
What about interrupt() method of thread class ?
How do you remove duplicates from an array in java?
What are basic keywords?
How do you sort arrays in java?
What is the list interface?
What does math floor () do?
how to create constants in java?
What is the difference between the size and capacity of a vector?
A non-static inner class may have object instances that are associated with instances of the class’s outer class. A static inner class does not have any object instances.
Can java program run without jre?
