广东工业大学数据结构AnyView参考答案
觉得还行,请点赞关注,您的点赞,我的动力!
1、第一章
-
#include "allinclude.h" //DO NOT edit this line void Descend(int &a, int &b, int &c) // 通过交换,令 a >= b >= c { // Add your code here if(a < b){ swap(a, b); } if(a < c){ swap(a,c); } if(b < c){ swap(b,c); } } void swap(int a, int b){ int c; c = a; a = b; b = a; }
-
#include "allinclude.h" //DO NOT edit this line float Polynomial(int n, int a[], float x0) { // Add your code here float result=0; for(int i = 0; i <= n; i++){ result += a[i]*pow((x0),i); } return result; }
-
。。。
-
#include "allinclude.h" //DO NOT edit this line Status Series(int a[], int n) { // Add your code here if(n == 0){ return ERROR; } int result=1, res = 1; for(int k = 1; k <= n; k++){ res = 1; for(int j