- 博客(5)
- 收藏
- 关注
RSS订阅原创 二分法举例
#include<stdio.h>#define M 10int main(){ int a[M] = { -12,0,6,16,23,56,80,100,110,115 }; int n,low, mid, high, find; low = 0; high = M - 1; find = 0; printf("please input number:\n"); scanf_s("%d",&n); while ...
2022-02-03 22:30:48
491
原创 冒泡法使用
#include<stdio.h> //冒泡法#define N 10int main(){ int a[N], i, j, t; printf("please input %dnumber:\n",N); for (i = 0; i < N; i++) { printf("a[%d] = ",i); scanf_s("%d",&a[i]); } for (i = 0; i < N - ...
2022-01-22 12:28:22
359
原创 找出矩阵最大元素
#include<stdio.h>#define M 3#define N 3int main(){ int a[M][N], max, row, col,i,j; for (i = 0; i < M; i++) { for (j = 0; j < N; j++) { scanf_s("%d",&a[i][j]); } } max = a[0][0];...
2022-01-22 12:24:30
327
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人