Hill similarities and differences and merge sort of

Hill sorting: actually a special insertion sort, Shell sort the array so that any interval H elements are ordered, the array is called H ordered array, for each H , carried out by insertion sort Sort.

Merge: Based on the idea of ​​partition, to be sorted array (recursively) into two halves, each sort of two parts, and then merge the results together.