Introduction - If you have any usage issues, please Google them yourself
Hill sorting (Shell Sort) is a sort of insertion sort. Also known as narrowing incremental sort, is a more efficient version of the direct insertion sort algorithm. The Hill sort is an unstable sorting algorithm. The method was named after DL.Shell was put forward in 1959.
The Hill sort is grouped by a certain increment of the record. Each group uses direct insertion sort algorithm. As the increment gradually decreases, each group contains more and more keywords. When the increment is reduced to 1, the whole file is divided into one group and the algorithm terminates.