Optimal_Merging

Optimal merging of different data sets or files.

Optimal merge pattern using greedy approach.

Optimal merge pattern is a greedy method to merge two or more files in the minimum possible time.
To achieve our objective, we start with the two smallest files.
In the next step, we merge the next two smallest files,
including the file that we merged in the previous step.
And, do the same till we get the only one file.

For e.g. suppose we have four files f₁, f₂, f₃ & f₄ with sizes 5, 7, 3 & 8 respectively.
Step 1 : Merge f₃ (size = 3) & f₁ (size = 5), we get f₃₁ (size = 8).
Step 2 : Merge f₂ (size = 7) & f₄ (size = 8), we get f₂₄ (size = 15).
Step 3 : Merge f₃₁ (size = 8) & f₂₄ (size = 15), we get f₃₁₂₄ (size = 23).

Here's a diagramatic expalanatiion :