Step 1: Understand time complexity
Time complexity measures algorithm efficiency for average cases. Step 2: Evaluate options
Bubble Sort: $O(n^2)$ average case.
Selection Sort: $O(n^2)$ average case.
Quick Sort: $O(n \log n)$ average case.
Insertion Sort: $O(n^2)$ average case. Step 3: Select best algorithm
Quick Sort has the best average-case time complexity: $O(n \log n)$.
Was this answer helpful?
0
0
Top Questions on Computer Languages and Algorithms