Which sorting algorithm has the best average-case time complexity among these?
A
Selection Sort
B
Bubble Sort
C
Quick Sort
D
Insertion Sort
Correct Answer: Option C — Quick Sort
Explanation:
Quick Sort generally has an average-case time complexity of O(n log n), making it more efficient than Bubble Sort, Selection Sort, and Insertion Sort, which typically have average-case complexities of O(n squared) for large datasets.