Question 9936 – Algorithms

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 1^st, 2^nd and 3^rd smallest elements in minimum number of comparisons.

Correct Answer: A