Question

a. (5 marks) Analyse the following algorithms to find the worst case and determine which one of the previous two algorithms is better & why? Algorithm1 (?, ?,) 1. for i <- 1 to n do 2. for j <- 1 to n do 3. C [i, j] <- 0.0 4. for k <- 1 to n do 5. C [i, j] <- C [i, j] + A [i, k] * B [k, j] 6. return C Algorithm2 (A) 1. for p <- 2 : n do 2. w <- A [p] 3. i <- p 4. while i > 0 and A[i] > w do 5. A[i] <- A [i - 1] 6. i <- i - 1 7. A[i] <- w 8. return A

          a. (5 marks) Analyse the following algorithms to find the worst case and determine
which one of the previous two algorithms is better & why?
Algorithm1 (?, ?,)
1. for i <- 1 to n do
2.  for j <- 1 to n do
3.  C [i, j] <- 0.0
4.  for k <- 1 to n do
5.  C [i, j] <- C [i, j] + A [i, k] * B [k, j]
6. return C
Algorithm2 (A)
1. for p <- 2 : n do
2.  w <- A [p]
3.  i <- p
4.  while i > 0 and A[i] > w do
5.  A[i] <- A [i - 1]
6.  i <- i - 1
7.  A[i] <- w
8. return A

a. (5 marks) Analyse the following algorithms to find the worst case and determine
which one of the previous two algorithms is better why?
Algorithm1 (?, ?,)
1. for i <- 1 to n do
2. for j <- 1 to n do
3. C [i, j] <- 0.0
4. for k <- 1 to n do
5. C [i, j] <- C [i, j] + A [i, k] * B [k, j]
6. return C
Algorithm2 (A)
1. for p <- 2 : n do
2. w <- A [p]
3. i <- p
4. while i > 0 and A[i] > w do
5. A[i] <- A [i - 1]
6. i <- i - 1
7. A[i] <- w
8. return A

Added by Iker P.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Maanya Naveen

Step 1

For Algorithm1: Show more…

Show all steps

Thanks for your feedback!

Algorithm1 (A, B) 1. for i <- 1 to n do 2. for j <- 1 to n do 3. C[i, j] <- 0.0 4. for k <- 1 to n do 5. C[i, j] <- C[i, j] + A[i, k] * B[k, j] 6. return C Algorithm2 (A) 1. for p <- 2 to n do 2. w <- A[p] 3. i <- p 4. while i > 0 and A[i] > w do 5. A[i] <- A[i - 1] 6. i <- i - 1 7. A[i] <- w 8. return A