If I have 1000 objects and my requirement is to sort them
quickly, then which collection would you recommend and why?
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
Mention some interfaces implemented by linked list in java.
What is the purpose of using bufferedinputstream and bufferedoutputstream classes?
What are sets in java?
How to change the priority of thread or how to set priority of thread?
What is the use of callablestatement?
What are different types of references?
What is meant by tab pans?
Is main an identifier?
How many bits is a word?
What is locale in java?
What are the two ways to create a thread?
What is the purpose of the strictfp keyword?
In which language java is written?
How many wrapper classes are there in java?
If goto and const is reserve words than why it is not work in java?