Question: The 2-D array A of floating point values representing the adjacency matrix of a weighted non-directed graph with N vertices is input to the following
The 2-D array A of floating point values representing the adjacency matrix of a weighted non-directed graph with N vertices is input to the following algorithm:
- What is the objective of this algorithm?
- Find T(N) = number of array element comparisons + number of arithmetic operations needed to return the result.
- Find the best and worst case complexities of this algorithm in terms of N.
ALGORITHM Enigma (A[0..N - 1,0..N - 1]) //Input: A matrix A[0..N-1, 0..N-1] of floating point values { } for i=0 to N-1 { D = 0; for j=0 to N-1 {if ( A ! = 0) D = D +1; } if (D
Step by Step Solution
★★★★★
3.57 Rating (164 Votes )
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Here we can observe from the value of D calculated during the end of inner for l... View full answer

Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock