Chapter 8, Problem 12CRP

Program Plan Intro

Program Plan:

• Suppose Inputlist1 and Inputlist2 be the two sorted contiguous lists and Outputlist be the other list that is used to store the obtained sorted list from the two input lists.
• The output file will be empty if both the input files are empty.
• If Inputlist1 is not empty then the first entry of the Inputlist1 will be the current entry.
• If Inputlist2 is not empty then first entry of the Inputlist2 will be the current entry.
• Compare the elements of both the elements when both the input lists are not empty.
• The value which is smaller among all enters the output list first.
• If the value of current entry is the last entry then the input list is at EOF. Otherwise, the next entry will be the current entry.
• For the case when the input list is not at EOF, start from the current entry in the input list and then copy the remaining entries to the output list.