自己编的希尔排序@TOC
#include
#include
#include"stdlib.h"
#define OVERFLOW 0
#define OK 1
#define LIST_INIT_SIZE 100
#define LISTINCREMENY 10
using namespace std;
typedef struct
{
int *elem;
int length;
int listsize;
}SqList;
int InitList_Sq(SqList *L)
{
L->elem = (int *)malloc(LIST_INIT_SIZE * sizeof(int));
if (!L->elem) exit(OVERFLOW);
L->length = 0;
L->listsize = LIST_INIT_SIZE;
return OK;
}
void ShortSort(SqList *L)
{
int i, j,temp;
int increment = L->length;
do {
increment = increment / 3 + 1;
for (i = increment; i < L->length; i++)
{
if (L->elem[i] < L->elem[i - increment])
{
temp = L->elem[i];
for (j = i - increment;j>=0&& L->elem[j] > temp; j -= increment)
{
L->elem[j+increment] = L->elem[j ];
}
L->elem[j + increment] = temp;
}
}
} while (increment > 1);
}
int main()
{
int x, i;
SqList L;
InitList_Sq(&L);
cout << “输入线性表:” << endl;
while (std::cin >> x)
{
L.elem[L.length] = x;
L.length++;
}
for (i = 0; i < L.length; i++)
{
std::cout << L.elem[i] << “”;
}
ShortSort(&L);
for (i = 0; i < L.length; i++)
{
std::cout << L.elem[i] << “”;
}
system(“pause”);
return 0;}
实验结果: