Description: 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
To Search:
File list (Check if you may need any files):
自编小程序
..........\keshangyong.h
..........\ksy.cpp
..........\LinkedList.cpp
..........\Main.cpp
..........\Main.plg
Download