The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is:
Notice difference with respect to question --> https://gateoverflow.in/1997/gate2014-2-38
Arrange files in increasing order of records
D A C B E
$5$ $10$ $15$ $20$ $25$
$15$ $15$ (C) $20$ (B) $25$ (E)
$5$ (D) $10$ (A)
No of movements$=15+30+45+75=165$
"This is different from another greedy problem in which we simply merge the files one into another in after arranging them in ascending order."
In the above solved question, we have used to "MERGE" procedure from merge sort which takes one element of each array compare them and put them in the final or output array.
No of movements=15+30+45+75=165
Let's say |c| = 5 and |p| = ...