Introduction - If you have any usage issues, please Google them yourself
1. Find Sum.
Given a set of n integers (in sorted order) and another integer x.
The algorithm has been designed that verifies whether there exist pairs of integers a and b such that
a + b = x,
Algorithm should output all such pair of integers.
our program takes as input a sequence of numbers in sorted order (in first line), the integer x (in second line) and outputs the resulting pairs as a,b (each pair on a separate line).
Note: Order of occurrence in output file among these resulting pairs should be maintained.
eg.
Input file (input.txt)
15 19 20 23 27 31 40 45
60
Output file (output.txt)
15,45
20,40
It assumes that our program is compiled into findSum.out executable and takes input.txt file as input and output.txt file as output.
./findSum.out input.txt output.txt