Does merge sort work by;

taking a list of values

splitting it in to two

take the first element of each list, the lowest value one goes in to a new list(and i guess removed from the original). comare the next two numbers - do this until one list is empty, then place the rest of the other list at the end ofthe nw list?

Also, what are the ramifications of doing this on a linked list?

Thanks