1060.5263157 etc your teacher prob tells you to round
Assuming we need to find i such that
1 ≤ i ≤ n and t[i]=i.
If we need to find only the first occurrence, we can do:
for i:1 to n {
if t[i]=i then return(i)
}
If exhaustive search is required, then put the results (values of i) in an array or a linked list, return the number of values found, and the array (or linked list).
Answer:
The attachment is black
Step-by-step explanation:
:/
<em>Look</em><em> </em><em>at</em><em> </em><em>the</em><em> </em><em>att</em><em>ached</em><em> </em><em>picture</em>
<em>hope</em><em> </em><em>it</em><em> </em><em>will</em><em> </em><em>help</em><em> </em><em>u</em><em> </em><em>.</em><em>.</em><em>.</em><em>.</em>
Answer:
5
Step-by-step explanation:
divide the distance by the rate of speed
5/1=5