Interested to Buy Any Domain ? << Click Here >> for more details...
Explain Big-O notation with an example
- 1 Answers
- 1481 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 |
How do you relate a Interface to a Class? Tell me in Detail?
What is meant by nested loop?
what is singleton in java?
What is persistence ?
How does hashset works in java?
What are invisible components?.
Where local and global variables are stored?
What is regex in java?
What is the platform?
Why synchronization is important?
How the elements are organized in GridBagLayout?
Can we initialize the final blank variable?
Core Java 
