use DP On 10/10/10, ashish agarwal <ashish.cooldude...@gmail.com> wrote: > take two pointer p and q > p=a[0] and q=a[n-1]; > sum=p+q; > if(sum>x) > q--; > if (sum<x) > p++; > > > > On Sun, Oct 10, 2010 at 6:54 PM, Rohit <email.rohit.n...@gmail.com> wrote: > >> >> >> On Oct 10, 10:48 am, Shravan <shravann1...@gmail.com> wrote: >> > http://ideone.com/D5W2y >> > >> >> Good :). >> What if array is unsorted. What will be the best solution in terms of >> time complexity? >> Better then (nlog(n)+n). >> >> Regards >> Rohit >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > >
-- DIPANKAR DUTTA M-TECH,Computer Science & Engg. E&C Dept,IIT ROORKEE Uttarakhand , India – 247667 ------------------------------------------- website:http://people.iitr.ernet.in/shp/09535009/Website/index.html ph no-09045809987 email:dipan...@iitr.ernet.in <email%3adipan...@iitr.ernet.in> -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
