Which sorting algorithm is more efficient for large datasets: heapsort vs quicksort?

Quicksort is generally more efficient than heapsort for large datasets due to its average-case time complexity of O(n log n) compared to heapsort's O(n log n) worst-case time complexity.