挑战程序设计竞赛（算法和数据结构）——3.6希尔排序的JAVA实现

Posted 2022-12-06 小乖乖的臭坏坏

题目&思路：

代码：

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class ShellSort 
    public static long cnt;
    public static int A[] = new int[1000000];
    public static int n;
    public static ArrayList<Integer> G = new ArrayList<>();

    public static void insertionSort(int A[], int n, int g)
        for(int i=g;i<n;i++)
            int v= A[i];
            int j=i-g;
            while (j>=0 && A[j]>v)
                A[j+g] = A[j];
                j -= g;
                cnt++;
            
            A[j+g] = v;
        
    

    public static void shellSort(int A[], int n)
        //生成数列G=1,4,13,40,121,364,1093..
        for (int h=1;;)
            if (h>n)break;
            G.add(h);
            h = 3*h+1;
        

        for (int i=G.size()-1;i>=0;i--)//按逆序指定G[i]=g
            insertionSort(A,n,G.get(i));
        
    

    public static void main(String[] args) 
        Scanner cin = new Scanner(System.in);
        n = cin.nextInt();
        for (int i=0;i<n;i++)
            A[i] = cin.nextInt();
        
        cnt=0;

        shellSort(A, n);

        System.out.println(G.size());

        for (int i=G.size()-1;i>=0;i--)
            System.out.print(G.get(i));
            if(i!=0) System.out.print(" ");
        
        System.out.println();
        System.out.println(cnt);
        for (int i=0;i<n;i++)
            System.out.println(A[i]);
        
        
    

输入：

5
5
1
4
3
2

输出：

2
4 1
3
1
2
3
4
5