Answer:
0(n)
Step-by-step explanation:
Result previous exercise:
procedure count(a1a2...an : string with n > 1)
i:=0
for k:=1 to n
if ak =1 then i:=i + I
return i
<em>Note</em><em>: If you use a different algorithm, then you could possible get different results. </em>
<u>SOLUTION </u>
There is only one part of the code that contains an operation (comparison), namely if a_k =1
This comparison is executed in every iteration of the for-loop
k can take on the values from 1 to n (for k:=I to n), thus k can take on n values.
Thus in total there are then n comparisons, while n is 0(n).
Answer:
Idk
Step-by-step explanation:
Answer:
theres nothing attached
Step-by-step explanation:
Answer:
21
Explanation:
d=m/v
3=m/7
Multiply both sides by 7 to cancel it out of the right side
3*7=(m/7)7
21=m
I hope this helps! Please comment if you have any questions.
You can not eat out, go to a movie, and go to a concert in the same month because you would exceed your budget of $100 by $10.