Radix sorting is an advanced sorting algorithm which sorts an array of values based upon the number of digits in a value than comparing the values for equality. Read more about radix sort in this article with appropriate examples and implementations in various languages.
Merge sorting is an advanced sorting algorithm which uses divide and conquer policy. Merge sorting is not an in-place sorting algorithm. Using merge sort we can improve the speed of sorting but at the cost of space. If you want to see how it is done, go ahead and try it yourself over a cup of coffee.