Calculate the following algorithm 's complexity by summation Method. (5)+(2.5+2.5) a)for (int j = 0; j...

Transcribed Image Text:

Calculate the following algorithm 's complexity by summation Method. (5)+(2.5+2.5) a)for (int j = 0; j<N; j++) for (int i = 0; i <-j; i++) for (int k = 0; K <-j; K++) if (A[i]>100) A[i] = 10 b)for (int j = 0; j<N*N; j++) for (int i=0; i<N*N; i++) T=T + 2 * R-Y; c)for (int j = 1; j<N; j++) for (int i = 0; i < N-j; i++) if (A[i]> A[i+1]) { Temp = A[i]; A[i] = A[i+1]; A[i+1] = Temp; } Calculate the following algorithm 's complexity by summation Method. (5)+(2.5+2.5) a)for (int j = 0; j<N; j++) for (int i = 0; i <-j; i++) for (int k = 0; K <-j; K++) if (A[i]>100) A[i] = 10 b)for (int j = 0; j<N*N; j++) for (int i=0; i<N*N; i++) T=T + 2 * R-Y; c)for (int j = 1; j<N; j++) for (int i = 0; i < N-j; i++) if (A[i]> A[i+1]) { Temp = A[i]; A[i] = A[i+1]; A[i+1] = Temp; }

Answer rating: 100% (QA)

af... View the full answer