Problem Description It is the same problem as in Exercise1, but you have to write a different program. We are given an input file that contains
word Sumofk,
"target" number K,
and a sequence of N numbers.
We want to determine if there are two numbers whose sum equals the given "target" number K.
For instance, if the input file contains
//word SumOfK II
"target" number K I/
sequence of N numbers 10 8416
We know from the file that K is 10, sequence of numbers is 8 4 16, and number of elements N is 4 (we can count numbers). In this case, the answer is yes, there are two such numbers (4 and 6), because 4+6 is 10
One number may be used twice (doubled). If the input file is SumOfK 10 8453 the answer is also yes, because 5+5 is 10.
Lab1 Program Devise and implement an O(N log(N)) algorithm to solve the problem. Split it in two parts-sort the items first, after it is done, you have to search for numbers in O(N). See https://en. wikipedia. org/wiki/Heapsort Code the solution. Read data from input file inX. txt and print the results to output file outx. txt (where X is 1, 2,.. The differences between Lab1 and Exercise1 are
1. The algorithm has to consist of two parts-O(N"log(N)) sorting and O(N) searching
2. The output file has also to contain the sorted list of input numbers