Merge sort is good for large data sets, while insertion sort is good for small data sets.

shell uses an odd number,merge uses an even number?

types of sorting in c language are:

insertion sort

selection sort

bubble sort

merge sort

two way merge sort

heap sort

quick sort

Top down merge sort is the easy way of merge sort in C language . It is used to derived o(n log n) algorithm . This is in par with the other methods.

Can be. (Meaning: you can merge sorted files without loading them entirely into the main memory.)