摘要:
Task 1 #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; printf 阅读全文
摘要:
Task 1-1 #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; printf("origina 阅读全文
摘要:
task1-1 #include <stdio.h> long long fac(int n); int main() { int i, n; printf("Enter n: "); scanf("%d", &n); for (i = 1; i <= n; ++i) printf("%d! = % 阅读全文
摘要:
#include<stdio.h> int main() { printf(" o o \n" " <H> <H> \n" " I I I I \n"); return 0; } #include<stdio.h> int main() { printf(" o \n" " <H>\n" " I I 阅读全文