Explain Big-O notation with an example
- 1 Answers
- 615 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 we extend singleton class in java?
what is singleton class in java?
Name few java.lang classes introduced with java 8 ?
What are the Abstract Classes provided by Java?
What is difference between float and double?
Can we override the overloaded method?
What are predefined functions?
What is the use of collections in java? How it is implemented in real time applications?
What is the difference between interpreter and compiling ?
How do you include a string in java?
What are the parameters used in Connection pooling?
Why is java architectural neutral?
Core Java 
