Answer:
I don't have a Apple, but I suggest you either contact Apple Help, or go to settings and see if you can reset it.
Add-on:
I hope this helped you at all.
I think the corret answer would be C
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).
-100 it is horruble, I would never join the class
Answer:
You use a for loop when you know how many times you want to run the loop
Explanation:
if you dont know, use a while loop
