How to realize Hill sorting in python

This article is about how Hill ranking is implemented in python. The editor thinks it is very practical, so share it with you as a reference and follow the editor to have a look.

Hill ranking

Hill sort is based on insert sort, with an "interval" sublist of unordered tables, and each sublist performs insert sort.

Group first, then insert

Hill sorting, also known as "decreasing incremental sorting", is an unstable sorting method.

The basic idea of Hill sorting is to divide the whole list into several sub-lists and insert and sort each sub-list. Then decrease the interval and divide it into more sublists until the interval is 1. When the whole list is close to order, insert and sort the whole list.

By setting the list of spacers, the elements at the same interval are compared, and if the latter is small, the two elements are exchanged. The interval of each trip is reduced, and the interval of the last trip is 1, which is the standard insertion sort. Since the list has been processed in close order, the last trip can be sorted with only a few moves.

The interval of the sub-list usually starts with nmax 2, with each trip multiplied by nmax 4, nmax 8. one

Thank you for reading! This is the end of the article on "how to achieve Hill ranking in python". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, you can share it for more people to see!