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
In how many ways we can do exception handling in java?
Can list be null in java?
What are locale settings?
What are instance variables?
Write a program to check for a prime number in java?
What does sprintf mean?
What does mean in regex?
What is jit and its use?
Explain method overloading?
Do extraneous variables affect validity?
What does += mean coding?
What is the byte order of byte buffer?
What are variable arguments or varargs?
What do negative exponents mean?
Which class should you use to obtain design information about an object in java programming?
