What is Hill sort?

Today, I would like to talk to you about what Hill ranking is, many people may not know much about it. In order to make you understand better, the editor summarized the following content for you. I hope you can get something from this article.

Hill sorting is a kind of insertion sorting, also known as "reduced incremental sorting". It is a more efficient and improved version of the direct insertion sorting algorithm. Hill sorting is an unstable sorting algorithm, which is named after "D.L.Shell" in 1959.

Hill ranking

A group of elements to be sorted are divided into several sequences according to a certain interval, and are inserted and sorted respectively. The "interval" set at the beginning is larger, and the interval is gradually reduced in each round of sorting until the interval is 1, that is, the last step is to do a simple insert sort.

Time complexity: unstable sorting related to the selection of incremental sequences

Brief introduction:

Hill sorting (Shell's Sort) is a kind of insertion sorting, also known as "reduced incremental sorting" (Diminishing Increment Sort), which is a more efficient and improved version of the direct insertion sorting algorithm. Hill sorting is an unstable sorting algorithm. This method is named after D.L.Shell proposed in 1959.

Hill sorting is to group records according to a certain increment of subscript and sort each group using the direct insertion sorting algorithm; as the increment decreases gradually, each group contains more and more keywords, and when the increment is reduced to 1, the whole file is divided into a group. the algorithm is terminated.

After reading the above, do you have any further understanding of what Hill ranking is? If you want to know more knowledge or related content, please follow the industry information channel, thank you for your support.