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
When is the garbage collection used in Java?
What are the 3 types of loops in java?
What is regex java?
What is the function of character?
What is the basic of java?
What is array length in java?
Is main an identifier?
What is difference between variable declaration and definition?
How to reverse string in java?
Explain about wait() method?
What are the characteristics of Final,Finally and Finalize keywords.
What are the different http methods?
What are the legal parameters?
State one difference between a template class and class template.
What is the use of private static?
