tag:blogger.com,1999:blog-6314876008291942531.post13507541018144653..comments2024-01-14T00:36:43.430-08:00Comments on Antonio Gulli's coding playground: Given a sorted array find two elements with sum = cUnknownnoreply@blogger.comBlogger1125tag:blogger.com,1999:blog-6314876008291942531.post-92206788236669463772010-11-19T04:02:03.733-08:002010-11-19T04:02:03.733-08:00std::pair find_sorted(const std::vector& vin, ...std::pair find_sorted(const std::vector& vin, int sum)<br />{<br /> int start = 0;<br /> int end = vin.size()-1;<br /> while ( start < end ) {<br /> if ( vin[start]+vin[end] > sum ) {<br /> --end;<br /> } else { <br /> if ( vin[start]+vin[end] < sum ) {<br /> ++start;<br /> }<br /> else {<br /> return std::pair(start, end);<br /> }<br /> }<br /> }<br /> return std::pair(0, 0);<br />}<br /><br />void test_find_sorted()<br />{<br /> std::vector vin;<br /> vin.push_back(1);<br /> vin.push_back(3);<br /> vin.push_back(4);<br /> vin.push_back(5);<br /> vin.push_back(7);<br /> vin.push_back(9);<br /><br /> std::pair res1= find_sorted(vin, 7);<br /><br /> std::pair res2= find_sorted(vin, 11);<br />}Unknownhttps://www.blogger.com/profile/07376509552713139770noreply@blogger.com