If I have 1000 objects and my requirement is to sort them
quickly, then which collection would you recommend and why?
- 5 Answers
- 7093 Views
- KPIT, I also Faced
- E-Mail Answers
Answer Posted / muni sankar
Heapsort is one of the best general-purpose sorting
algorithms, a comparison sort and part of the selection sort
family. Although somewhat slower in practice on most
machines than a good implementation of quicksort, it has the
advantages of worst-case O(n log n) runtime and being an
in-place algorithm
| Is This Answer Correct ? | 0 Yes | 8 No |
Post New Answer View All Answers
What is dynamic array in java?
What is stack class in java?
What is the difference between abstraction and encapsulation?
How many bytes is a string java?
What is java regex?
Can we extend singleton class in java?
What is Java Package and which package is imported by default?
What is an interoperable application in java ?
How to do a true java ping from windows?
What is JFC?
which is advanced deep technology in java launched by the sun microsystem??? The answer is very logical If u need correct answer mail me at priya_gupta@gmail.com
Can Exception handling we can handle multiple catch blocks?
What is the difference between public, private, protected, and friend access?
How to implement a multithreaded applet?
Will the jvm load the package twice at runtime?
