Mazdak Farrokhzad edited Version 3.tex  over 10 years ago

Commit id: 1de135a0e15878ab827ec4b0f3e036de3577f2e4

deletions | additions      

       

4 j < a.length; (2 op/turn + 2 extra turn at end of loop)  5 j++ ) { (1 op/turn, compiler will probably turn it to ++j)  6 thisSum += a[j]; (2 op/turn)  7 if( thisSum > maxSum ) { (2 op/turn,if is  most complex: so we disgard if, ignore  else-if ) 8 maxSum = thisSum; (2 op/turn)  9 seqStart = i; (2 op/turn)  10 seqEnd = j; (2 op/turn)