Question: (d) Consider the following piece of JavaScript code: function sumOfArray(array, l, r) { if (1>r) { } return 0; } else if (1 ==r)
(d) Consider the following piece of JavaScript code: function sumOfArray(array, l, r) { if (1>r) { } return 0; } else if (1 ==r) { return array[1]; } var m= Math.floor((1+r)/2): var sumL = sumofArray (l, m); var sumR = sumOfArray (m + 1, r); return sumL + sumR; function sum0fNumbers (n) { if (n == 0) { return 0; } for (var i = 1; i (d) Consider the following piece of JavaScript code: function sumOfArray (array, 1, r) { if (1>r) { return 0; } else if (1 ==r) { return array[1]; } } var m Math.floor((1+r)/2): var sumL = sumofArray (l, m); var sumR = sumOfArray (m + 1, r); return sumL + sumR; function sum0fNumbers (n) { if (n == 0) { return 0; } for (var i = 1; i
Step by Step Solution
3.31 Rating (154 Votes )
There are 3 Steps involved in it
1 sumOfArray function uses the divide and conquer algorithm because here we are basically dividing t... View full answer
Get step-by-step solutions from verified subject matter experts
