Describe the step-by-step logic of a Merge Sort algorithm to a non-programmer. Use a metaphor involving a library or a deck of cards to explain the 'divide' and 'conquer' phases. Avoid using any code snippets or specific programming syntax.