a. (5 marks) Analyse the following algorithms to find the worst case? Algorithm1 (A, B,) 1....

 

Transcribed Image Text:

a. (5 marks) Analyse the following algorithms to find the worst case? Algorithm1 (A, B,) 1. for i <1 to n do 2. 3. 4. 5. for j1 to n do C [i, j] 0.0 for k 1 ton do 6. return C C [i, j] C [i, j] + A [i, k] * B [k, j] Answer: Algorithm2 (A) 1. for p2: n do 2. 3. 4. 5. 6. 7. WA [p] i < p while i > 0 and A[i] >w do A[i] a. (5 marks) Analyse the following algorithms to find the worst case? Algorithm1 (A, B,) 1. for i <1 to n do 2. 3. 4. 5. for j1 to n do C [i, j] 0.0 for k 1 ton do 6. return C C [i, j] C [i, j] + A [i, k] * B [k, j] Answer: Algorithm2 (A) 1. for p2: n do 2. 3. 4. 5. 6. 7. WA [p] i < p while i > 0 and A[i] >w do A[i]

Answer rating: 100% (QA)

To analyze the worstcase complexity of the given algorithms 1 Algorithm1 The algorithm has three nes... View the full answer