Question

How to find if there is a pair in sorted array with sum equal to a given sum in C++

Answer 1

#include <iostream>

bool isPairWithAGivenSum(int arr[], int size, int sum) {
    for (int i = 0; i < size; i++) {
        for (int j = 0; j < size; j++) {
            if (i == j) {
                continue;
            }

            if (arr[i] + arr[j] == sum) {
                std::cout << "i = " << i << " j = " << j << "\n";
                return true;
            }

            if (arr[i] + arr[j] > sum) {
                break;
            }
        }
    }

    return false;
}

int main()
{
    int arr[] = { 3, 5, 6, 8, 9, 12, 13, 15 };
    int sum = 17;
    int size = sizeof(arr) / sizeof(arr[0]);

    std::cout << isPairWithAGivenSum(arr, size, sum);
}





/*
run:

i = 1 j = 5
1

*/

 

70+ SQL courses for beginners and professionals