In the best case, quicksort divides the array into two equal halves, leading to a time complexity of O(n log n).
