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 constructor and virtual function? Can we call a virtual function in a constructor?
I have 100 records in a table with two rows. I need to display 10 records per page like Google Search. I need only the Logic(Pagination) in Pure Java. No JSP and all..Thanks in Advance...
Can a boolean be null java?
Is a case study a method or methodology?
What is run-time class and system class? what is their purpose?
Is integer a class?
what is main difference between architecture,framework and design pattren
Which class is the superclass of all classes?
What is difference between static class and singleton pattern?
What is your platform’s default character encoding?
State some situations where exceptions may arise in java?
what is diff bet iterator and enumeration?