Interested to Buy Any Domain ? << Click Here >> for more details...
Explain Big-O notation with an example
- 1 Answers
- 1399 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 |
Is string a class?
What is protected access modifier?
Difference between predicate, supplier and consumer ?
Is 64bit faster than 32 bit?
Is there a sort function in java?
How do you load an HTML page from an Applet ?
Why java is said to be pass-by-value ?
When will we prefer to use set and list in java and why?
Explain the concept of polymorphism with examples?
what is bytecode ?explain in detail and watz the difference between bytecode and machine code?
What do you understand by the term string pool?
What is the functionability stubs and skeletons?
Core Java 
