Hi guys .
I'm struggling to implement in C/C++ a function that gets as two inputs , one input is an integer array, second input is the given sum.
the function returns the pairs of two element that its sum equal to the given sum.
I don't have much experience in C/C++, and I started to implement the function by myself.
I've seen the solution here step by step :
https://www.youtube.com/watch?v=WJP62MCWTM8&t=209s
but I really didn't understand the logic of the explained code in the video, could anyone please explain to me the algorithm / the code that's explained on the video?
how really we find the matched two pairs that its sum equal to the given sum?
For me a pseudo code is also awesome to understand the solution of the problem.
Much appreciated.
I'm struggling to implement in C/C++ a function that gets as two inputs , one input is an integer array, second input is the given sum.
the function returns the pairs of two element that its sum equal to the given sum.
I don't have much experience in C/C++, and I started to implement the function by myself.
I've seen the solution here step by step :
https://www.youtube.com/watch?v=WJP62MCWTM8&t=209s
but I really didn't understand the logic of the explained code in the video, could anyone please explain to me the algorithm / the code that's explained on the video?
how really we find the matched two pairs that its sum equal to the given sum?
For me a pseudo code is also awesome to understand the solution of the problem.
Much appreciated.