[5 Marks question]
Let A be an n*n matrix such that the elements in each row and each column are arranged in ascending order. Draw a decision tree which finds 1st, 2nd and 3rd smallest elements in minimum number of comparisons.
Answer:
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post