A________search begins the search with the element that is located in the middle of the array.
| A. | Serial |
| B. | Random |
| C. | Parallel |
| D. | Binary Search |
Answer : D Explanation : Binary Search algorithm can do this because it firstly searchs the middle element. If required element is less than the middle one, then search the middle element in the less than part. If required element is greater than the middle one, then search in the greater part. So the answer is 'D'. |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
