[algogeeks] find pair in O(N)

one of microsoft interview questionif anybody interested in given array int num[10]={1,-5,6,7,9,9,20,25,31,45} it is a sorted array. write a function void findsum(int [],int x) int [] is array and x is number. function should print all possible pair of elements in array that can make a

[algogeeks] Re: find pair in O(N)

thanks. it works. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL