Answer:
The worst case running time of a linear search is O(N).
Explanation:
In a linear search, you will run the program looking at each array position until you find your desired information.
The best case scenario is when you find it at the first position.
The worst case scenario is when you find the value at the last array position. So, in a N-length array, the information is at position N. This means that the worst case running time of a linear search is O(N).
Answer:
it depends on your insurance company
Explanation:
Answer:
Umm what? Are you talking about the type of problem it is? If so it is an optimization problem.
Explanation:
I had something like this for one of my tests and I chose the optimization problem because it finds the values of decision variables that result in a maximum or minimum of a function.
But ion know if it's this that you are talking about
