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
how many types of Inheritance?
How do you declare a variable?
How can an exception be thrown manually by a programmer?
How do you find the absolute value?
What is the exception hierarchy in java?
Can a class have a static inner class?
What is integer parseint?
Is empty list java?
What is a static method in java?
What is the difference between static and global variables and also define what are volatile variables?
What is a singleton factory?
Difference between static binding and dynamic binding?
What is an anonymous class in java?
What are constants?
Is set thread safe java?
