0 votes 0 votes Q. An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is either maximum or minimum is A O(nlogn) B O(n) C O(logn) D O(1) Algorithms time-complexity + – kallu singh asked Aug 12, 2017 kallu singh 270 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes Since List is unordered , to find out either max or max you need to scan entire list at least one time so its O(n) aehkn answered Aug 12, 2017 • selected Aug 12, 2017 by srestha aehkn comment Share Follow See all 0 reply Please log in or register to add a comment.