If I have 1000 objects and my requirement is to sort them
quickly, then which collection would you recommend and why?
Answers were Sorted based on User's Feedback
Answer / sanjay
The question is about collection and not about the algorithm - My answer is array or arrayList. arraylist is backed by an array so it will have identical performance to an array.
Is This Answer Correct ? | 1 Yes | 1 No |
Answer / shankar
quick.it has the least time complexity and with the help
of pivot elements it gets sorted vvery easily.the time
complexity is log2n
Is This Answer Correct ? | 2 Yes | 3 No |
Answer / sanjay
ArrayList. indexing is easy, count of objects is already known.
Is This Answer Correct ? | 0 Yes | 3 No |
Answer / 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 |
Can a static class have a constructor java?
How are destructors defined in java?
Why to use nested classes in java? (Or) what is the purpose of nested class in java?
How do you create a first line indent?
What does string mean in java?
What are the 6 boolean operators?
What is the final access modifier in java?
What is mean by encoding?
What are the different types of collections in java?
Which is faster string or stringbuilder?
Where is the singleton class used?
What are the differences between include directive and include action?