Answered

The following algorithm adds all the entries in a square n × n array A. Analyze this algorithm where the work unit is the addition operation. sum = 0 for i = 1 to n do for j = 1 to n do sum = sum + A[i, j] end for end for write ("Total of all array elements is", sum)

Answer :

abdullahfarooqi

Answer:

T(n)=n(n+1)/2

Explanation:

See the attached picture for detailed explanation.

${teks-lihat-gambar} abdullahfarooqi

Other Questions