i am just confused about the speed and efficiency of inbuilt functions like Arrays.sort() in java . Is it faster than programmer 's written merge sort of O(log n) complexity?
To quote from javadoc:
The sorting algorithm is a Dual-Pivot Quicksort by Vladimir Yaroslavskiy, Jon Bentley, and Joshua Bloch. This algorithm offers O(n log(n)) performance on all data sets, and is typically faster than traditional (one-pivot) Quicksort implementations.
Its O(logn) only…
thanks for help.