Answer:
A linear search is one that scans every record/file until it discovers the value being searched for.
Binary search, on the other hand, is also known as <em>Logarithmic search</em>. It is used to locate the position of a value inside an array that has already been sorted.
The linear search will return the lowest value faster than the binary search when small arrays are involved.
This will only be feasible when the array is sorted prior.
Cheers!
The answer to this question is the term virtual memory. A virtual memory is a type of memory that uses a secondary memory which is implemented on hardware and software. A virtual memory maps and combines virtual addresses into a physical address inside the computer memory and operating system controls the memory into virtual memory.
