Skip to content
Related Articles

Related Articles

GATE | GATE CS 1999 | Question 56
  • Last Updated : 09 Oct, 2017

[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

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :