Which of the below given sorting techniques has highest best-case runtime…

Answer : B

Explanation:

Best-case time complexities:

• Quick Sort → O(n log n)

• Selection Sort → O(n²)

• Insertion Sort → O(n)

• Bubble Sort → O(n) (with optimized version)

Among these, the highest best-case runtime complexity is:

Selection Sort → O(n²)

Reason:
Selection sort performs the same number of comparisons regardless of input order, so even in the best case its complexity remains O(n²).