Hill sorting (JAVA) based on sorting algorithms)

[Java] public class ShellSort {/*** sorts n integers, groups the number of columns according to the d1 increment, directly inserts and sorts each group, then reduces the increment and groups again, sort groups until the increment value is 1. * Hill sorting is a Sort Algorithm inserted. Also known as reducing the complexity of incremental sorting to O (nlog n) * unstable sorting method * @ param nums to be sorted array * @ return output ordered array */www.2cto.com public static void sort (int [] nums) {int len = nums. length/2; while (len> = 1) {for (int I = 0; I <len; I ++) {// directly Insert the sort into the group for (int k = I; k <nums. length-len; k + = len) {int j = k + len; int temp = nums [j]; while (k> = 0 & nums [k]> temp) {nums [j] = nums [k]; k-= len; j-= len;} nums [j] = temp ;}} len = len/2 ;}}}