In a sorted array, which search algorithm is more efficient than linear search?*1 pointA. Binary SearchB. Quick SearchC. Bubble SortD. Merge Sort

To determine which search algorithm is more efficient than linear search in a sorted array, we need to compare the options provided: Binary Search, Quick Search, Bubble Sort, and Merge Sort.

1. Binary Search: This algorithm repeatedly divides the search space in half until the target element is found or the search space is empty. It is efficient for sorted arrays as it eliminates half of the remaining elements at each step. Therefore, Binary Search is more efficient than linear search in a sorted array.

2. Quick Search: Quick Search, also known as QuickSort, is a sorting algorithm rather than a search algorithm. It recursively partitions the array into smaller subarrays based on a chosen pivot element. While QuickSort is efficient for sorting, it is not a search algorithm and is not directly applicable to finding elements in a sorted array.

3. Bubble Sort: Bubble Sort is a simple sorting algorithm that repeatedly swaps adjacent elements if they are in the wrong order. While Bubble Sort can be used to sort an array, it is not a search algorithm and is not directly applicable to finding elements in a sorted array.

4. Merge Sort: Merge Sort is a divide-and-conquer sorting algorithm that divides the array into smaller subarrays, sorts them, and then merges them back together. Similar to QuickSort, Merge Sort is not a search algorithm and is not directly applicable to finding elements in a sorted array.

Based on the above analysis, the search algorithm that is more efficient than linear search in a sorted array is A. Binary Search.