插入排序

最新推荐文章于 2023-09-23 17:47:53 发布

秦慎强

最新推荐文章于 2023-09-23 17:47:53 发布

阅读量260

点赞数

分类专栏： algorithm

本文链接：https://blog.csdn.net/u011048370/article/details/9175635

版权

algorithm 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#define maxn 10000
void Insertion_Sort(int A[], int n){
int i, j, key;
for (j = 2; j <=n; j++){
  key = A[j];
  for (i = j - 1; i > 0&&A[i] > key; i--)
   A[i + 1] = A[i];
A[i + 1] = key;
}
}
int main(){
int A[maxn];
int n, i;
printf("请输入A数组个数:\n");
scanf("%d", &n);
printf("请输入数组中的数字\n");
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
Insertion_Sort(A, n);
for (i = 1; i <= n; i++)
printf("%d ", A[i]);
printf("\n");
return 0;
}