Performing binary search on an unsorted list will always return the correct answer in O(n) time where n is the length of the list. a) true
b) false

B. False

Explanation:

Binary search does not work in an unsorted list, therefore it will not return the correct answer in 0(n) time.

For an unsorted list, linear search is the better way of searching for algorithms.

For a binary search, it goes through a sorted list to locate a desired element. It repeats its processes until it picks the correct element it is looking for.

answer; insolated i/o uses separate memory space,and on the other hand memory mapped i/o uses memory from the main

the answer to your question is ⇔ d. the nether

explanation: