Interested to Buy Any Domain ? << Click Here >> for more details...
Explain Big-O notation with an example
- 1 Answers
- 1384 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 is synchronization and why is it important? : Java thread
What is flag in java?
Why are generics used?
give an example for encapsulation?
What is the difference in between cpp and java? Can u explain in detail?
what is overloading and overriding with example?
What is the default value of the local variables?
Is null false in java?
where u use Abstraction and Interface in real time
What are the types of java languages?
What are the advantages of java inner classes?
What is the public method modifier?
Core Java 
