Which of the following sorting algorithms has the minimum running time complexity in the best and average case?
- A. Insertion sort, Quick sort
- B. Quick sort, Quick sort
- C. Quick sort, Insertion sort
- D. Insertion sort, Insertion sort
Answer: A. Insertion sort, Quick sort
Explanation: Insertion sort best case is O(n). Quick sort average is O(n log n). Quick sort best is O(n log n). Insertion sort average is O(n²). The question asks for (Best, Average). Insertion Sort (n), Quick Sort (n log n). This combination gives minimums for the respective categories among standard comparisons.