0 0 votes Given a set of n distinct integers. It is desired to determine smallest of these integers using comparisons. Which is true? A) n + O(1) comparisons B) n + O(logn) comparisons C) O(n) comparisons D) O(log$^{2}$n) comparisons Algorithms + – Vipin Rai 568 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply manisha11 commented Nov 12, 2018 reply Follow flag C? 0 0 replyShare Manas Mishra commented Nov 12, 2018 reply Follow flag n-1 comparisons = O(n) comparisons using Tournament method 0 0 replyShare Vipin Rai commented Nov 13, 2018 reply Follow flag Solution given was B Using heap 0 0 replyShare Please log in or register to add a comment.
