Java uses quicksort and mergesort under the hood for built-in sorting of arrays and lists. These algorithms have efficiency:

O( n log n)
  • O(1)
  • O(n)
  • O(log n)

There are no hints for this question