Explain Big-O notation with an example
- 1 Answers
- 634 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 |
What are the uses of java?
How do you declare a string variable?
Have you used any version control ? if so explain about it?
What is the syntax and characteristics of a lambda expression? Explain
What does java ide mean?
What is string args [] in java?
What are the restrictions imposed by a Security Manager on Applets?.
Write the algorithm to check the number non-leaf nodes in a tree.
Explain about procedural programming language or structured programming language and its features?
What is final?
Difference between java and javascript
Why is core java important?
Core Java 
