answer:
1.The program comes to a line of code containing a "function call".
2.The program enters the function (starts at the first line in the function code).
3.All instructions inside of the function are executed from top to bottom.
4.The program leaves the function and goes back to where it started from.
5.Any data computed and RETURNED by the function is used in place of the function in the original line of code.
Answer:
See explaination
Explanation:
Keep two iterators, i (for nuts array) and j (for bolts array).
while(i < n and j < n) {
if nuts[i] == bolts[j] {
We have a case where sizes match, output/return
}
else if nuts[i] < bolts[j] {
this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1
}
}
Since we go to each index in both the array only once, the algorithm take O(n) time.
(A) Yes, because nobody is supposed to access non-work related sites during office hours.
Answer:
Bullet
Explanation:
I've written a paragraph before. I should know!
