Answer:
negative, it'll be negative 2
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:
7 and 1/3
Step-by-step explanation:
Answer:
4 Can I have brainiest me trying to level up
Step-by-step explanation:
Let's make the parenthesis go bye
8-4
so it would be 4
