# Getting a Pair whose Sum = K

### For Sorted Arrays:

```c
void findPair(int a[], int n, int key) {

    // Set i to starting index and j to last index
    int i = 0, j = n-1;
    
    while (i < j) {
        // If pair is found, increment i and decrement j
        if (a[i] + a[j] == key) {
            printf("Pair : %d and %d\n", a[i], a[j]); 
            i++;
            j--;
        }
        // If sum is greater than key, decrement j
        else if (a[i] + a[j] > key) {
            j--;
        }
        // If sum is smaller than key, increment i
        else {
            i++;
        }
        
    }

}
```

### For Unsorted Arrays:

```c
void findPair(int a[], int n, int max, int key) {
    
    // Create and initialize hash array with 0
    int h[max];
    for (int i = 0; i < max; i++) {
        h[i] = 0;
    }
    
    for (int i = 0; i < n; i++) {
        // Check if the suitable pair is present
        if (h[key - a[i]] != 0) {
            printf("Pair : %d and %d\n", a[i], key-a[i]);
        } 
        h[a[i]]++;
    }

}
```

Contributed by Nitin Ranganath


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://nitinranganath.gitbook.io/data-structures/arrays/getting-a-pair-whose-sum-k.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.