0 votes 0 votes An array whose elements are in ascending order then the time complexity for finding the minimum and maximum element of array ??? Shubham Aggarwal asked Jan 19, 2019 Shubham Aggarwal 227 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Kunal Kadian commented Jan 19, 2019 reply Follow Share O(1) 0 votes 0 votes muthu kumar commented Jan 19, 2019 reply Follow Share min = first element in array. max = last element in array. So, O(1). If unsorted, then 1 traversal needed to find min and max O(n) 3 votes 3 votes Please log in or register to add a comment.
