Which sorting algorithm generally provides the best average-case performance for large datasets?

Explanation: Quick Sort is often considered the fastest sorting algorithm in the average case because it has an average time complexity of O(n log n) and requires relatively low memory. It works by selecting a pivot element and partitioning the array into smaller subarrays. Although its worst-case complexity is O(n²), careful pivot selection usually results in very efficient performance in real-world applications.