it is the question regarding c++ programming and i am not able to solve it and i hope you will give me best solution

Question

Take an unsorted array of size 15 and type int from the user and a number n, find if there exists a

pair of elements in the array whose difference is n.

Examples:

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

Answer 1

using namespace std;

#include <iostream>

#define MAX (15)

Input(int * A, int * diff)

{

for (int iLoop=0; iLoop<MAX; iLoop++)

{

cout << "input # :>";

cin >> A[iLoop];

}

cout << "input the difference :>";

cin >> *diff;

}

int LinearSearch(int * A, int iTarget)

{

int iReturn=-1;

for (int iLoop=0; iLoop<MAX; iLoop++)

{

if (A[iLoop]==iTarget)

{

iReturn=iLoop;

break;

}

}

return(iReturn);

}

SearchDiff(int * A, int diff)

{

int found_flag=0;

for (int iLoop=0; iLoop<MAX; iLoop++)

{

if (LinearSearch(A,A[iLoop]+diff)>=0)

{

cout << " Pair Found (" << A[iLoop] << " , " << A[iLoop]+diff << ")" << endl;

found_flag=1;

break;

}

}

if (found_flag==0)

{

cout << " No such pair found " << endl;

}

}

int main()

{

int A[MAX];

int diff;

Input(A,&diff);

SearchDiff(A,diff);

}

Answer 2

Here is a simple flow that does the job.

#include <iostream>

using namespace std;

int n = 78;

int arr[] = {5, 20, 3, 2, 50,80};

int main() {

bool found = false;

for (int x = 0; x < sizeof(arr); x++) {

for (int y = 0; y < sizeof(arr); y++) {

if (arr[x] - arr[y] == n) {

cout << "Pair Found: (" << arr[x] << ", " << arr[y] << ")" << endl;

found = true;

}

}

}

if (not found) {

cout << "No Such Pair" << endl;

}

}