Which sorting algorithm has the best average time complexity?
A
Quick Sort
B
Bubble Sort
C
Selection Sort
D
Insertion Sort
Correct Answer: Option A — Quick Sort
Explanation:
Quick Sort has an average time complexity of O(n log n), making it more efficient than Bubble Sort, Selection Sort, and Insertion Sort for l...
Quick Sort has an average time complexity of O(n log n), making it more efficient than Bubble Sort, Selection Sort, and Insertion Sort for large datasets.