文件名称:Selfapplet
- 所属分类：
- Windows编程
- 资源属性：
- [C/C++] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 4kb
- 下载次数：
- 0次
- 提 供 者：
- canto*****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
运用单链表示,并对其进行运算(主要是多项式的赋值和相加)。
分析： 一元多项式在计算机内存储时，既可用顺序表存储，又可用链表存储。但当多项式的次数很高且系数相差很大时，则更适于用链表存储（通常设计两个数据域和一个指针域）。而当要求对多项式进行运算时
-That the use of single-chain, and its operations (mainly the assignment and the sum of polynomial). Analysis: A polynomial time in the computer storage, can be stored with the order form and list of available storage. However, when the high and the number of polynomial coefficients vary greatly, the list is even more suitable for storage used (usually two data design domain and a target domain). And when asked to carry out operations on the polynomial time
分析： 一元多项式在计算机内存储时，既可用顺序表存储，又可用链表存储。但当多项式的次数很高且系数相差很大时，则更适于用链表存储（通常设计两个数据域和一个指针域）。而当要求对多项式进行运算时
-That the use of single-chain, and its operations (mainly the assignment and the sum of polynomial). Analysis: A polynomial time in the computer storage, can be stored with the order form and list of available storage. However, when the high and the number of polynomial coefficients vary greatly, the list is even more suitable for storage used (usually two data design domain and a target domain). And when asked to carry out operations on the polynomial time
(系统自动生成,下载前可以参看下载内容)
下载文件列表
自编小程序
..........\keshangyong.h
..........\ksy.cpp
..........\LinkedList.cpp
..........\Main.cpp
..........\Main.plg
..........\keshangyong.h
..........\ksy.cpp
..........\LinkedList.cpp
..........\Main.cpp
..........\Main.plg