第16周项目1-验证算法(1)直接插入排序
来源:互联网 发布:k近邻算法代码 matlab 编辑:程序博客网 时间:2024/05/19 07:07
问题:
1.直接插入排序
- #include <stdio.h>
- #define MaxSize 20
- typedef int KeyType;
- typedef char InfoType[10];
- typedef struct
- {
- KeyType key;
- InfoType data;
- } RecType;
-
- void InsertSort(RecType R[],int n)
- {
- int i,j;
- RecType tmp;
- for (i=1; i<n; i++)
- {
- tmp=R[i];
- j=i-1;
- while (j>=0 && tmp.key<R[j].key)
- {
- R[j+1]=R[j];
- j--;
- }
- R[j+1]=tmp;
- }
- }
-
- int main()
- {
- int i,n=10;
- RecType R[MaxSize];
- KeyType a[]= {9,8,7,6,5,4,3,2,1,0};
- for (i=0; i<n; i++)
- R[i].key=a[i];
- printf("排序前:");
- for (i=0; i<n; i++)
- printf("%d ",R[i].key);
- printf("\n");
- InsertSort(R,n);
- printf("排序后:");
- for (i=0; i<n; i++)
- printf("%d ",R[i].key);
- printf("\n");
- return 0;
- }
运行结果:
2.显示直接插入排序过程
- #include <stdio.h>
- #define MaxSize 20
- typedef int KeyType;
- typedef char InfoType[10];
- typedef struct
- {
- KeyType key;
- InfoType data;
- } RecType;
-
- void InsertSort(RecType R[],int n)
- {
- int i,j,k;
- RecType tmp;
- for (i=1; i<n; i++)
- {
- tmp=R[i];
- j=i-1;
- while (j>=0 && tmp.key<R[j].key)
- {
- R[j+1]=R[j];
- j--;
- }
- R[j+1]=tmp;
- printf("i=%d: ",i);
- for (k=0; k<n; k++)
- printf("%d ",R[k].key);
- printf("\n");
- }
- }
-
- int main()
- {
- int i,n=10;
- RecType R[MaxSize];
- KeyType a[]= {9,8,7,6,5,4,3,2,1,0};
- for (i=0; i<n; i++)
- R[i].key=a[i];
- printf("排序前:");
- for (i=0; i<n; i++)
- printf("%d ",R[i].key);
- printf("\n");
- InsertSort(R,n);
- printf("排序后:");
- for (i=0; i<n; i++)
- printf("%d ",R[i].key);
- printf("\n");
- return 0;
- }
运行结果:
3.折半插入排序
- #include <stdio.h>
- #define MaxSize 20
- typedef int KeyType;
- typedef char InfoType[10];
- typedef struct
- {
- KeyType key;
- InfoType data;
- } RecType;
-
- void InsertSort1(RecType R[],int n)
- {
- int i,j,low,high,mid;
- RecType tmp;
- for (i=1; i<n; i++)
- {
- tmp=R[i];
- low=0;
- high=i-1;
- while (low<=high)
- {
- mid=(low+high)/2;
- if (tmp.key<R[mid].key)
- high=mid-1;
- else
- low=mid+1;
- }
- for (j=i-1; j>=high+1; j--)
- R[j+1]=R[j];
- R[high+1]=tmp;
- }
- }
- int main()
- {
- int i,n=10;
- RecType R[MaxSize];
- KeyType a[]= {9,8,7,6,5,4,3,2,1,0};
- for (i=0; i<n; i++)
- R[i].key=a[i];
- printf("排序前:");
- for (i=0; i<n; i++)
- printf("%d ",R[i].key);
- printf("\n");
- InsertSort1(R,n);
- printf("排序后:");
- for (i=0; i<n; i++)
- printf("%d ",R[i].key);
- printf("\n");
- return 0;
- }
运行结果:
学习总结:
插入的三种算法,其中直接插入最为简单稳定,适用于小数列。
0 0