Interested to Buy Any Domain ? << Click Here >> for more details...
If I have 1000 objects and my requirement is to sort them
quickly, then which collection would you recommend and why?
- 5 Answers
- 8688 Views
- KPIT, I also Faced
- E-Mail Answers
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 |
What is ‘is-a ‘ relationship in java?
Difference between Reader/Writer and InputStream/Output Stream?
9 Answers Adobe, Kirusa, Verizon,
What is string and its types?
garbate collector(GC)?
What is the difference between class & object?
What is gc()?
Explain polymorphism citing an example.
Explain, java is compatible with all servers but not all browsers?
Where is the singleton class used?
Can a static block throw exception?
Write the code for Palindrome ?
IN java collections we have both interfaces and classes. instead of using interfaces why we can't use classes only like that why we can't use interfaces only. why we need two things interface and class.
Core Java 
