Operation counts for scalar operation

The code

for (i = 0; i < n; i++){
    a[i] = b[i] + c[i];
}

has for $n$ repeats

1. one load for $c[i]$ in address 1
2. one load for $b[i]$ in address 2
3. add $c[i]$ and $b[i]$ to give $a[i]$
4. store $a[i]$ in address 2

• «
• 1
• ...
• 9
• 10
• 11
• 12
• 13
• 14
• 15
• 16
• 17
• 18
• 19
• 20
• 21
• 22
• 23
• 24
• 25
• 26
• ...
• 120
• »