When using the Merge Sort algorithm, I feel like everything makes sense until we start "merging" the elements back together. Why is it assumed implicitly that the process of merging will put the elements in order? Perhaps I'm not viewing this with the right perspective, but I feel that up until now the steps in algorithms have been very straightforward, but the merge step in Merge Sort seems to assumes that it inherently knows the order of things. Is ordering elements just a function of merge?
Apologies if my question isn't very clear, I'm trying to put my confusion into words the best I can. Any help shedding light on this would be much appreciated!