Answer:
There is also an attachment below
Explanation:
Since we are talking about binary search, let's assume that the items are sorted according to some criteria.
Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.
N = 700000000.
So, number of comparisions can be log(N) = 29.3 = 29.
So, in the worst case it does comparisions 29 times
Question
Student presentation concepts from another source
Letitia - a step-by-step process of breaking down glucose into energy
Mana - repeating process of the steps of the cell division, going from interphase to division, and back to interphase.
Paul - a series of organisms that show similar characteristics and compare them to those that do not
Which best describes the SmartArt graphic layout each student should use?
Answer:
Letitia would use a process, Maria would use a cycle, and Paul would use a relationship.
Explanation:
Letita's assignment requires her to show how glucose can be broken down into energy, this requires a series of steps in s linear fashion, meaning it would be best suited to a process-style diagram.
Marta's project involves showing the steps of the cell cycle: the clue is in the name. This process is not linear, and instead repeats itself, meaning it fits to a cycle diagram (i.e. a circular diagram)
Paul is comparing and contrasting different organisms. Therefore, he should use a relationship diagram to show shared characteristics as well as features that differ.
People who use Windows OS.
Answer:
I think it would be.
A-Metal-cast pouring system
<h2>
I hope it helps</h2>
