0.50 0. 62 0.72 0.80 0. 88 0.93 0.97 0.99 1.00 0.99 0.97 0.93 0.88 0. 80 0. 72 0

Question

0.50 0. 62 0.72 0.80 0. 88 0.93 0.97 0.99 1.00 0.99 0.97 0.93 0.88 0. 80 0. 72 0. 62 0.50 0.38 0.50 0. 60 0 69 0.76 0. 81 0. 85 0.88 0.88 0.88 0.850.810.76 0.690.600.50 0.38 0.28 0. 40 0. 50 0.59 0. 66 0.71 0. 75 0.77 0.78 0.77 0.75 0.71 0.66 0.59 0. 50 0. 40 0.28 0.20 0.31 0. 41 0.50 0.57 0. 62 0. 66 0.69 0.70 0.69 0.66 0.62 0.57 0.50 0. 41 0. 31 0.20 0.12 0.24 0. 34 0.43 0.50 0. 55 0. 59 0.62 0.62 0. 62 0.59 0.550.500.43 0.34 0.24 0.12 0 .07 0.190. 29 0.38 o. 450.50 0.54 0.56 o. 570. 560. 54 0.50 0. 45 0. 38 0.290.190.07 0.03 0. 15 0.25 0.34 0. 41 0. 46 0. 50 0.52 0.53 0.52 0.50 0.460.41 0.340.25 0.150.03 0.01 0.12 0.23 0.31 0.38 0. 44 0. 48 0.50 0.51 0.50 0.48 0.44 0. 38 0. 31 0. 23 0. 12 0. 01 0.00 0.12 0.22 0.30 0.38 0.43 0. 47 0.49 0.50 0.49 0. 47 0.43 0.38 0. 30 0.22 0.12 0.00 0.01 0.12 0.23 0. 31 0. 38 0.44 0.48 0.50 0.51 0. 50 0.48 0. 44l 0.38 0. 31 0. 23 0.12 0.01 0.03 0. 15 0.25 0.34 0. 41 0. 46 0. 50 0.52 0.53 0.52 0.50 0.46 0.41 0. 34 0. 25 5 0.03 0 .07 0. 19 0. 29 0.38 0. 45 0. 50 0.54 0.56 0.57 0.56 0.54 0.50 0. 45 0. 38 0. 29 0. 19 0. 07 0.12 0.24 0. 34 0.43 0.50 0. 55 0. 59 0.62 0.62 0. 62 0.59 0.55 0.50 0. 43 0. 3 4 0.24 0. 12 0.20 0.31 0. 41 0.50 0.57 0. 62 0. 66 0.69 0.70 0.69 0.66 0.62 0.57 0.50 0. 41 0. 31 0.20 0.28 0. 40 0. 50 0.59 0. 66 0.71 0. 75 0.77 0.78 0.77 0.75 0.71 0.66 0.59 0. 50 0. 40 0.28 0.38 0.50 0.60 0.69 Ca D D 3 14 O 9 0.60 0.50 0.38 0.50 0.62 0.72 0.80 80 0.72 0.62 0.50

Explanation / Answer

Assersions:
rMin(rowNumber) - finds min value in a row
cMax(colNumber) - finds maxvalue in a colum
rows=total no. of rows
cols=total no. of cols

Pseudo Code :

For each row i=1->rows
   For each col j=1->cols
       rMin[i] = MIN(rMin[i], A[i][j]) //checking if element is minimum in that row
       cMax[j] = MAX(cMax[j], A[i][j]) //checking if element is maximum in that column
For each row i=1->rows
   For each col j=1->cols
       if A[i][j] == rMin[i] == cMax[j] //checking if element is minimum in that row and maximum in that column
print saddlePoint(r, c)

Running time algorithm using O-notation:
The complexity of this algorithm id O(n`2) as we have used a nested Loop of i and j.

Related Questions

Navigate

• Browse (All)
• Browse
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.