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!
Answer:
it is when u talk to someone
Answer:time-sensitive email
Answer:
I don't think so. In today's computer era, many different solution directions exist for any given problem. Where OOP used to be the doctrine of choice, now you would consider it only when the problem at hand fits an object-oriented solution.
Reason 1: When your problem can be decomposed in many different classes with each many instances, that expose complex interactions, then an OO modeling is justified. These problems typically produce messy results in other paradigms.
Reason 2: The use of OO design patterns provides a standardized approach to problems, making a solution understandable not only for the creator, but also for the maintainer of code. There are many OO design patterns.
