The most efficient code will be surely of O(n). This is because there is no
way of finding
the min and max without scanning the entire array atleast once.
Is this so? or any counter arguments ?
On Sat, Jul 2, 2011 at 1:06 AM, rajeevrvis rajeev.open.1...@gmail.comwrote:
Are there any Algorithms
, Jul 1, 2011 at 12:57 PM, Hemanth Sagar hemanth2...@gmail.comwrote:
The most efficient code will be surely of O(n). This is because there is
no way of finding
the min and max without scanning the entire array atleast once.
Is this so? or any counter arguments ?
On Sat, Jul 2, 2011 at 1:06 AM
