Question: Translate pseudo code to java to find transitive closures for matrices Language: Java Algorithm Input: relation R on a set of n elements Output: transitive
Algorithm Input: relation R on a set of n elements Output: transitive closure R* A MIR for (k 1 to n) for (i = 1 to n) for (j = 1 to n) B[i][j] = A[i][i] OR (A[JK] AND A[k]U) for (i 1 to n) for (j 1 to n) return A Run time- outer loop runs n times two nested loops inside, each takes (n2) total time n(n2 + n2) - run time of algorithm is O(n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
