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
- 8696 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 the default initialized value of a boolean type variable?
Every class extends object but why it is not possible for every object to invoke clone() method. ideally protected methods should be accessible from sub classes. isn't it?
What are dot operator queries?
What are the different types of multitasking?
How many types of methods are there?
List types of storage classes in java?
define System.out.println(); what is the meaning!
What are virtual functions?
Can try statements be nested?
How the elements are organized in GridLayout?
how to print a numbers from 1 to 100 with out using control structures?
What is the default initialized value of String type variable?
Core Java 
