1037: 希尔排序

题目描述

已知希尔排序的部分代码如下，勿改动，请补充实现希尔排序函数，要求输出每趟排序结果，增量序列取值依次为5,3,1。
#include
using namespace std;
const int MaxSize=100;
class List
{
private:
int r[MaxSize+1];
int n;
public:
List(){n=0;} //empty list
void InsertR(int k) //表尾插入
{ r[++n]=k;}
void Display(); //display
void ShellSort(); //ShellSort
};
void List::Display()
{
for(int i=1;i<=n;i++)
cout< cout<<”\n”;
}
int main()
{
List L;
while(1)
{
int k;
cin>>k;
if(!k) break;
L.InsertR(k);
}
//L.Display();
L.ShellSort();
// L.Display();
return 0;
}

输入

输出

样例输入

12 21 32 2 4 24 21 432 23 9 0

样例输出

12 21 32 2 4 24 21 432 23 9
2 4 23 9 21 24 12 432 32 21
2 4 9 12 21 21 23 24 32 432

提示

来源

提交

import java.util.Scanner;
class Ilist{
    int[] r;
    int n;
    int MaxSize = 100;
    public Ilist() {
        n = 0;
        r = new int[MaxSize];
    }
    void InsertR(int k){
        r[++n] = k;
    }
    void Display(){
//        System.out.print("Data:");
        for (int i = 1; i <= n; i++) {
            System.out.print(r[i]+" ");
        }
        System.out.println();
    }
    void ShellSort(){
        int j;
        int increment = 5;
        for (int d = increment; d >= 1; d -= 2) {
            for (int i = d + 1; i <= n; i++) {
                r[0] = r[i];
                for (j = i - d; j > 0 && r[0] < r[j]; j -= d) {
                    r[j + d] = r[j];
                }
                r[d + j] = r[0];
            }
            Display();
        }
    }
}
public class Main {
    public static void main(String[] args) {
        Ilist ilist = new Ilist();
        Scanner scanner = new Scanner(System.in);
        while(true){
            int x = scanner.nextInt();
            if(x == 0)break;
            ilist.InsertR(x);
        }
        ilist.ShellSort();
    }
}