12 2021 档案

摘要：#include<stdio.h> #define N 5 typedef struct student { long no; char name[20]; int score; }STU; void input(STU s[],int n) ; int findminlist(STU s[],ST 阅读全文

摘要：#include <stdio.h> #define N 5 int binarySearch(int *x, int n, int item); // 函数声明 int main() { int a[N] = {2, 7, 19, 45, 66}; int i, index, key; print 阅读全文

摘要：#include <stdio.h> #define N 5 void output(int x[], int n); int main() { int x[N] = {9, 55, 30, 27, 22}; int i; int k; // 用于记录最大元素的下标 int t; // 用作交换两个 阅读全文

摘要：#include <stdio.h> const int N = 4; int main() {int a[N] = {2, 0, 2, 1}; char b[N] = {'2', '0', '1', '1'}; int i; printf("sizeof(int) = %d\n", sizeof( 阅读全文