![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
笔记
南栀倾寒980
这个作者很懒,什么都没留下…
展开
-
插入排序
1.#include<stdio.h> 2.int main() { 3.int k, x, N,i; 4.scanf("%d", &N); 5.int a[100]; 6.for ( i = 0; i < N; i++) { 7.scanf("%d", &a[i]); } 8.int temp, j; 9.for ( i = 1; i < N; i++) { 10. j = i - 1; temp = a[i]; 11.while (a[j] > temp原创 2021-10-23 18:32:26 · 44 阅读 · 0 评论 -
找大小
#include<stdio.h> int main(void) { int n; scanf("%d",&n); if(n==1) { printf(“0\n0”); } else if(n>=2) { double a[n]; int i; for(i=0;i<n;i++) { scanf("%lf",&a[i]); } double max=a[0];double min=a[0]; for(i=0;i<n;i++) { if(a[i]>max) .原创 2021-10-23 18:28:21 · 61 阅读 · 0 评论 -
插入排序
#include<stdio.h> int main() { int k, x, N,i; scanf("%d", &N); int a[100]; for ( i = 0; i < N; i++) { scanf("%d", &a[i]); } int temp, j; for ( i = 1; i < N; i++) { j = i - 1; temp = a[i]; while (a[j] > temp&&j >.原创 2021-10-23 18:18:56 · 76 阅读 · 0 评论