Question

Given an array numbers[] and a number N display for all pair in numbers[] with a difference as 2N

Answer 1

Answer:

Input: arr[] = {5, 20, 3, 2, 50, 80}, n = 78

Output: Pair Found: (2, 80)

Input: arr[] = {90, 70, 20, 80, 50}, n = 45

Output: No Such Pair

// C++ program to find a pair with the given difference

#include <bits/stdc++.h>

using namespace std;

 

// The function assumes that the array is sorted

bool findPair(int arr[], int size, int n)

{

   // Initialize positions of two elements

   int i = 0;

   int j = 1;

 

   // Search for a pair

   while (i < size && j < size)

   {

       if (i != j && (arr[j] - arr[i] == n || arr[i] - arr[j] == n) )

       {

           cout << "Pair Found: (" << arr[i] <<

                       ", " << arr[j] << ")";

           return true;

       }

       else if (arr[j]-arr[i] < n)

           j++;

       else

           i++;

   }

 

   cout << "No such pair";

   return false;

}

 

// Driver program to test above function

int main()

{

   int arr[] = {1, 8, 30, 40, 100};

   int size = sizeof(arr)/sizeof(arr[0]);

   int n = -60;

   findPair(arr, size, n);

   return 0;

}

 

//