Write a function to return minimum and maximum in an array. You program should make minimum number of comparisons. (less than O(2n))
Anonymous
O(2n) is O(n)... The simple answer, just compare each value once and keep track of the max and min, replace if you find a new one. That only requires a single pass.
Check out your Company Bowl for anonymous work chats.