摘要:
task4: complex.hpp: #pragma once #include<iostream> #include<cmath> using std::cout; using std::endl; class complex{ public: complex(double r=0.0,doub 阅读全文
摘要:
#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; // 用作交换两个 阅读全文