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:
The issue with open source software is that it is usable (and editable) by anyone. When it comes to military robotics, the software that is used to run the robots must remain confidential. If it is not, anyone could take the software that the military is using to make their robots function and replicate it, which could be extremely dangerous.
Explanation:
Open source software is available to the general public.
Feel free to copy and paste this or put it into your own wording. Have a nice day!
