Which searching algorithm has the best average-case time complexity for a sorted array?
Correct: B
Binary search has the best average-case time complexity (O(log n)) for searching a sorted array because it repeatedly divides the search interval in half. Linear search has O(n), while Bubble and Selection Sort are sorting algorithms, not searching algorithms.