插入排序之
直接插入排序与希尔排序简单代码实现
``cpp
#include
#include <stdlib.h>
#include <time.h>
using namespace std;
const int Max = 10;
void Creat(int r[ ], int n);
void InsertSort(int r[ ], int n);
void ShellSort(int r[ ], int n);
int main( )
{
int a[Max + 1] = {0}, b[Max + 1] = {0};
int i = 0;
Creat(a, Max);
for (i = 1; i <= Max; i++)
b[i] = a[i];
cout<<“对于无序序列:”;
for (i = 1; i <= Max; i++)
cout<<b[i]<<" “;
cout<<endl;
InsertSort(b, Max);
cout<<“执行直接插入排序后,元素为:”;
for (i = 1; i <= Max; i++)
cout<<b[i]<<” “;
cout<<endl;
cout<<“对于无序序列:”;
for (i = 1; i <= Max; i++)
cout<<a[i]<<” “;
cout<<endl;
ShellSort(a, Max);
cout<<“执行希尔排序后,元素为:”;
for (i = 1; i <= Max; i++)
cout<<a[i]<<” ";
cout<<endl;
return 0;
}
//直接插入排序
void Creat(int r[ ], int n)
{
int i = 0;
srand(time(NULL));
for (i = 1; i <= n; i++)
r[i] = 1 + rand() % 100;
}
//希尔排序
void InsertSort(int r[], int n){
for(int i=2;i<=n;i++){
r[0]=r[i];
int j=i-1;
for(;r[0]<r[j];j–){//从下标j依次往前面比较(每次距离为1),若r[0]小于r[j],则把r[j]往后面移动一位
r[j+1]=r[j];
}
r[j+1]=r[0];
}
}
void ShellSort(int r[ ], int n){
int d;
for(d=n/2;d>=1;d=d/2){
for(int i=d+1;i<=n;i++){
r[0]=r[i];
int j;
for( j=i-d;j>0&&r[0]<r[j];j=j-d)//从下标j依次往前面比较(每次距离为d),若r[0]小于r[j],则把r[j]往后面移动都位
r[j+d]=r[j];
r[j+d]=r[0];
}
}
}