Which sorting algorithm has the best average case time complexity?
A
Bubble Sort
B
Insertion Sort
C
Quick Sort
D
Selection 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 simpler algorithms like bubble or sele...
Quick Sort generally has an average case time complexity of O(n log n), making it more efficient than simpler algorithms like bubble or selection sort for large datasets.