2020-11-18

希尔排序

//希尔排序
#include<iostream>
using namespace std;
void shellsort(int* a, int  n)
{
    int t;
    for (int k = 0; k <sizeof(a); k++)
  {
    if(k+n<sizeof(a))
    {
        for(int i = k; i < sizeof(a); i = i + n)
        {
            for (int j = k; j < i; j = j + n)
            {
                if (a[i] < a[j])
                {
                    t = a[i]; a[i] = a[j]; a[j] = t;
                }
            }
        }
    }
    else
    {
        k=-1;
        n=n/2;
    }
    if(n<1)
    break;
   }
}
int  main()
{
    int  n;
    cin >> n;
    int* a = new int[n];
    for (int i = 0; i < n; i++)
        cin >> a[i];
    shellsort(a, n);
    for (int i = 0; i < n; i++)
        cout << a[i];
}