Find all pairs of integers within an array which sum to a specified value

Question

Design an algorithm to find all pairs of integers within an array which sum to a specified value.

I have tried this problem using a hash

Answer 1

We can use C++ STL map to solve this

void subsetSum(int arr[], int n, int sum)
{
    mapMap;

    for(int i=0; i