quick.it has the least time complexity and with the help of pivot elemen

If I have 1000 objects and my requirement is to sort them
quickly, then which collection would you recommend and why?

Question Posted / shankar

Answer Posted / 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

Please Help Members By Posting Answers For Below Questions

Does java vector allow null?

897

Define max and min heap, also the search time of heap.

989

What is the finalize method do?

1049

What is api in java?

934

Can we override private constructor in java?

913

What class of exceptions are generated by the java run-time system?

1121

What is append function?

943

Explain different types of wrapper classes in java?

956

Can constructor be static or final?

1040

How many threads can I run java?

1047

How to run a JAR file through command prompt?

1210

What is static data type in java?

981

What is length in java?

962

How to create com object in Java?

1013

What is the difference between a synchronized method and a synchronized block?

1017