利用函数和递归做一个数列的加减运算，数列的加减运算有一定的规律，可利用函数与计算出结果
The constant can be calculated by the infinite series:
= 4- 4/3+ 4/5- 4/7+ 4/9- 4/11+....
Write a C program that uses a do/while loop to calculate using the series. The program should ask the user how many terms in the series should be used. Thus if the user enters ‘3’, then the program should calculate as being 4- 4/3+ 4/5.
(2012-05-16, C/C++, 5KB, 下载5次)
、一元多项式的加法、减法、乘法的实现
【问题描述】
设有一元多项式Am(x)和Bn(x)，
Am(x)=A0+A1x1+A2x2+A3x3+… +Amxm
Bn(x)=B0+B1x1+B2x2+B3x3+… +Bnxn
请实现求M(x)= Am(x)+Bn(x)、M(x)= Am(x)-Bn(x)和M(x)= Am(x)×Bn(x)。
【基本要求】
首先判定多项式是否稀疏；
分别采用顺序和动态存储结构实现；
结果M(x)中无重复阶项和无零系数项；
要求输出结果的升幂和降幂两种排列情况
【进一步完成内容】
界面设计的优化。
, A polynomial of addition, subtraction, multiplication problems to achieve 【Description】 There is a polynomial Am (x) and Bn (x), Am (x) = A0+ A1x1+ A2x2+ A3x3+ ...+ Amxm Bn ( x) = B0+ B1x1+ B2x2+ B3x3+ ...+ Bnxn please realize find M (x) = Am (x)+ Bn (x), M (x) = Am (x)-Bn (x) and M (x) = Am (x) × Bn (x). First determine the basic requirements of】 【polynomial is sparse were used to achieve sequential and dynamic storage structure result M (x) in the non-repeat-order items and non-zero coefficient term required output of both ascending and descending order situation 【Content】 interface complete further design optimization. (2010-12-27, C/C++, 121KB, 下载5次)
在C语言下，采用动态生成的方法，利用BF硬译码，来对 LDPC译码的程序。
In the C language, using dynamically generated methods, the use of BF decoding hardware to the procedure of LDPC decoding. (2010-11-02, C/C++, 4KB, 下载26次)
实现ASC字符转16进制字符，示例 a （ASC码97）转换为0x61
Achieve the ASC switch to 16 hexadecimal characters in character, sample ' a' (ASC Code 97) is converted to 0x61 (2010-03-22, C/C++, 162KB, 下载56次)
分析Unix最先适应（first fit，ff）存储分配算法。即map数据结构、存储分配函数ma lloc()和存储释放函数mfree()，找出与算法有关的成分。修改上述算法有关成分，使其分别体现BF(best fit，最佳适应)分配原则WF(worst fit，最坏适应)分配原则。
Analysis of Unix was first to adapt to (first fit, ff) memory allocation algorithm. The map data structure, storage allocation function ma lloc () and memory release function mfree (), and algorithms to identify the elements. Modify the above algorithm as the ingredients, so that, respectively, embody BF (best fit, best fit) the principle of distribution WF (worst fit, the worst adaptation) distribution. (2010-01-09, C/C++, 1KB, 下载19次)