java hill sort
Hill sorting is a type of insertion sorting, and can also be vividly called shrinking increment method. The basic idea is to divide an array into several arrays, a bit like the divide and conquer method, but the division here is controlled by a constant d.
This 0<d<n, n is the length of the array. This algorithm has the speed of insertion sort, and can also be regarded as an improved algorithm. In the insertion algorithm, if there is a smallest number at the end of the array, the insertion algorithm will duplicate the last one.
Moving the position to the first one will waste a lot of money. Using this improved Hill sorting can achieve long-span movement of data elements. This is the advantage of this algorithm.
Copy the code code as follows:
package cn.cqu.coce.xutao;
public class shell3 {
public static void main(String args[]){
int a[]={7,43,23,5,3,2,0,6,74,9};
int n=a.length;
for(int i=0;i<n;i++)
System.out.print(a[i]+"/t");
System.out.println();
for(int gap=n/2;gap>0;gap/=2){
for(int i=gap;i<n;i++){
for(int j=i-gap;j>=0&&a[j]>a[j+gap];j-=gap){
int temp=a[j+gap];
a[j+gap]=a[j];
a[j]=temp;
}
}
}
for(int i=0;i<n;i++)
System.out.print(a[i]+"/t");
System.out.println();
}
}
Second example
Copy the code code as follows:
class Shell
{
public void shell_sort(int [] arrays){
for(int d=5;d>0;d=d-2){
for(int c=0;c<arrays.length-d;c++){
for(int i=c;i<arrays.length;i=i+d){
for(int j=i;j>0;j=jd){
if(j<d)
break;
if(arrays[j]<arrays[jd]){
int tmp;
tmp=arrays[j];
arrays[j]=arrays[jd];
arrays[jd]=tmp;
}
}
}
}
snp(arrays);
}
}
public void snp(int[] arrays){
for(int i=0;i<arrays.length;i++){
System.out.print(arrays[i]+" ");
}
System.out.println();
}
public static void main(String[] args)
{
Shell s=new Shell();
int[] a={45,20,80,40,26,58,66,70};
s.shell_sort(a);
}
}
Running results:
Copy the code code as follows:
---------- java ----------
20 70 40 26 58 66 80
20 58 45 26 70 66 80
26 40 45 58 66 70 80
Output completed (took 0 seconds) - normal termination