Describe the step-by-step process of a Merge Sort algorithm purely in descriptive natural language, avoiding all programming syntax. Imagine you are instructing a human who has no coding knowledge but needs to physically sort a deck of cards indexed with random numbers. Break the recursion down into specific physical actions involving splitting piles and merging them, ensuring the logic regarding comparison and order is preserved.