Question

1.) Write a function called canMakeSum() that takes a sorted array of n integers and determines whether two distinct elements of the array add up to some specified value, "key". If so, return 1. Otherwise, return 0. The function signature is:

int canMakeSum(int *array, int n, int key);

Answer 1

int canMakeSum(int *array, int n, int key) {
    int i, j;
    for(i = 0; i < n; ++i) {
        for(j = i+1; j < n; ++j) {
            if(array[i] + array[j] == key) {
                return 1;
            }
        }
    }
    return 0;
}