Interested to Buy Any Domain ? << Click Here >> for more details...
Explain Big-O notation with an example
- 1 Answers
- 1564 Views
- I also Faced
- E-Mail Answers
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 |
Can list be final in java?
How do you sort words in java?
why an outer class cannot be declared as private?
What is return keyword in java?
Can an interface extend a class?
What are the differences between forwarding () method and sendredirect() methods?
What access modifiers can be used for methods?
Is java good for beginners?
How do you sort in ascending order in java?
What is lazy activation?
What is the preferred size of a component in java programming?
What is an 8 bit word?
Core Java 
