Question

Which of the following sorting algorithms has the best average-case time complexity?

• A. Bubble Sort
• B. Selection Sort
• C. Quick Sort
• D. Insertion Sort

Hint:

Choose Quick Sort for large datasets due to its efficient average performance.

Answer 1

The Correct Option is C

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)$.