在数据结构中实现两个一元多项式的相加、相减和相乘

这是一个运用多种排序法对数据进行排序的程序,排序时间复杂性小,空间复杂性小,排序速度快.压缩包包括源程序文件,再vc中运行.-This is a use of a variety of data sequencing procedures for ordering, scheduling time complexity of small, space complexity of small, fast order. Compressed including source files, then vc run.

对绘图工作者，绘图工作可能有一定的帮助。-right Mapping workers, drawings may be of some help.

一个电力部门的催缴费用系统，有需要大家可参考-A reminder of the cost of the electricity sector systems, there is a need we can refer to

用VB实现的信用社贷款管理系统的课程设计，可以实现数据库中信息的查询、删除、修改等功能。-Using VB to achieve credit loan management system, curriculum design, can achieve the information in the database query, delete, modify other functions.

字典树算法，可以很方便的实现多叉树，而且查找很方便，是ACM算法设计中常用的数据结构-Dictionary tree algorithm, can be very convenient multi-tree, and find very convenient is the design of ACM algorithms commonly used data structure

Data Structures and Algorithms with Object-Oriented Design Patterns in C# 这本书的范例代码dll自己反编译的source code http://www.brpreiss.com/books/opus6/-Data Structures and Algorithms with Objec t-Oriented Design Patterns in C# this book since dll code examples his opposition to the compiler source code http :// www.brpreiss.com/books/opus6/

数据库系统：访问数据库。访问数据库并能对出错进行捕捉-database system : access to the database. Access to the database and is able to capture for mistakes

数据库系统概论（第三版） pdf格式图书 萨师煊著-Introduction to Database Systems (third edition) pdf format book with Savimbi division Xuan

这几个是本人整理的.cpp程序，您可以借鉴参考------>> dos前景背景色设置.cpp 二．八．十．十六进制转换程序的函数.cpp 二叉树的遍历.cpp 图形的广度优先搜寻法.cpp 图形的深度优先搜寻法.cpp 用C语言编的一个日历.c-these are my finishing. Cpp and you can draw reference--- gt; Gt; Dos prospects for the background color set. Cpp two. 8. 10. Hexadecimal conversion function. Cpp binary tree traversal. Cpp graphics priority to search for the breadth of France. Cpp graphics depth-first search of the law. Cpp C language compile a calendar. C

用c++写一个售货员问题。这是高级算法中除了红黑树中最难的一个了。是研究生课程中的的程序实现-used to write a salesman problem. This is in addition to the High algorithm RED-BLACK TREE which one of the most difficult. The postgraduate courses in the program