Why java api uses different sorting algorithms?

Question

Java Collections.sort() uses mergesort while Arrays.sort() uses quicksort. What's the rationale for the different choices? Is this from some difference between collection and array?

Answer 1

I believe you are mistaken. The Arrays.sort() methods for primitives use a type of quicksort that gives n*log(n) performance. The Arrays.sort() methods that act on Objects use a mergesort (n*log(n)), just like Collections.sort().

Answer 2

Yeah equipment.currentTimeMillis(); like this long start up=equipment.currnetTimeMillis(); //your code equipment.out.println("Time taken is "+(equipment.currentTimeMillis()-start up)); this might provide term in milliseconds confirm to take long no longer int