The following program creates two linked list and merges them in ascending order and taking care of redundancy of the data.
struct node… 399 more words
Ans. There is no wastage of time in this method.
Ans. However; this scheme is not efficient; to traverse the list, we must read each block, which requires substantial I/O time.
Cannot get continuous space easily.
Strategy: Multiply a number of one list through all the numbers of the other list, adding as you go. then add that value to the total sum before moving on the next number to multiply through. 317 more words