#include<stdio.h>
#include<time.h>
#include<stdlib.h>
#define MaxSize 50
typedef struct
{
int key;
}RecordType;
void InsertSort(RecordType r[], int length)
{
for (int i = 2; i < length; i++)
{
r[0] = r[i];
int j = i - 1;
while (r[0].key < r[j].key)
{
r[j + 1] = r[j];
j = j - 1;
}
r[j + 1] = r[0];
}
}
void SelectSort(RecordType r[], int length)
{
int x;
for (int i = 1; i <= length - 1; i++)
{
int k = i;
for (int j = i + 1; j <= length; j++)
{
if (r[j].key < r[k].key)
{
k = j;
}
}
if (k != i)
{
x = r[i].key;
r[i].key = r[k].key;
r[k].key = x;
}
}
}
void BubbleSort(RecordType r[], int length)
{
int t;
for (int i = 1; i <= length; i++)
{
for (int j = 1; j <= length - i - 1; j++)
{
if (r[j].key > r[j + 1].key)
{
t = r[j+1].key;
r[j + 1].key = r[j].key;
r[j].key = t;
}
}
}
}
int QKPass(RecordType r[], int left, int right)
{
int low = left;
int high = right;
r[0] = r[left];
while (low < high)
{
while (low<high && r[high].key>r[0].key)
{
high--;
}
if (low < high)
{
r[low] = r[high];
low++;
}
while (low < high && r[low].key < r[0].key)
{
low++;
}
if (low < high)
{
r[high] = r[low];
high--;
}
}
r[low] = r[0];
return low;
}
void QKSort(RecordType r[], int low, int high)
{
if (low < high)
{
int pos = QKPass(r, low, high);
QKSort(r, low, pos - 1);
QKSort(r, pos + 1, high);
}
}
void ShellInsert(RecordType r[], int length, int delta)
{
int i, j;
for (i = 1 + delta; i <= length; i++)
{
if (r[i].key < r[i - delta].key)
{
r[0] = r[i];
for (j = i - delta; j > 0 && r[j].key > r[0].key; j -= delta)
{
r[j + delta] = r[j];
}
r[j + delta] = r[0];
}
}
}
void ShellSort(RecordType r[], int length, int delta[], int n)
{
for (int i = 0; i < n; i++)
{
ShellInsert(r, length, delta[i]);
}
}
void ShowResult(RecordType* r, int length)
{
for (int i = 1; i <= length; i++)
{
printf("%d\t", r[i]);
if (i % 10 == 0)
{
printf("\n");
}
}
}
void RandNum(RecordType r[MaxSize])
{
srand((unsigned)time(NULL));
for (int i = 1; i <= 300; i++)
{
r[i].key = rand() % 100000 + 1;
printf("%d\t", r[i]);
if (i % 10 == 0)
{
printf("\n");
}
}
}
}
int main(void)
{
int n, m;
RecordType r[301] ;
int delta[] = { 150, 70, 35, 14,7,3,1 };
int[a]=RandNum(r);
InsertSort(a, 300);
printf("直接插入排序结果为:\n");
ShowResult(r, 30);
printf("\n");
SelectSort(a, 300);
printf("归并排序结果为:\n");
ShowResult(r, 300);
printf("\n");
BubbleSort(a, 300);
printf("冒泡排序结果为:\n");
ShowResult(r, 300);
printf("\n");
ShellSort(a, 300, delta, 7);
printf("希尔排序结果为:\n");
ShowResult(a, 300);
printf("\n");
QKSort(a, 1, 299);
printf("快速排序结果为:\n");
ShowResult(a, 300);
printf("\n");
}