Does anyone know the running time in big O notation for the arrays.sort java method? I need this for my science fair project.
Arrays.sort() uses Tim sort - O(N log N) for array of objects and QuickSort for arrays of primitives - again O(N log N).
Arrays.sort()
Tim sort
QuickSort
Here is an awesome comparison of sorting algorithms: http://www.sorting-algorithms.com/