Do u want to output all the pairs or just 2 integers??
On 6/12/11, p2pnode <jagrati.agra...@gmail.com> wrote:
> Problem:
>
> Given an integer 'k' and an sorted array A (can consist of both +ve/-
> ve nos), output 2 integers from A such that a-b=k.
> PS:
> nlogn solution would be to check for the occurence of k-a[i] (using
> binary search) when you encounter a[i]. methods like hash consume
> space.
>
> Is an O(n) solution with O(1) extraspace possible?
>
> My code:
>
> main()
> {
> int array[] = {6,4,3,1,0,-1};
> int n=6;
> int target=5;
> int diff;
> int left=0;
> int right=1;
>
> while ( left != n && right != n ) // left< right) // or should the
> condition be
> {
> diff=array[left]-array[right];
> if (diff > target)
> {
> left++; right++; // check for end condition
> }
>
> else if(diff == target)
> {
> printf("%d %d\n",array[left],array[right]);
> left++;right++;
> }
>
> else
> {
> right++;
> }
> }
> }
>
> --
> 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
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=100000655377926 *
--
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
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
