数据结构课程设计_任意大数的加减乘运算器

VC下的ADO编程封装类。可灵活方便的应用于VC下的ADO编程-VC under the category ADO programming package. Flexibility can be applied to the VC under the ADO programming

这是聊天系统的服务器端，它控制客户端程序的登录和连接，采用ACCE-This is a server-side chat system, which controls the client program to log in and connect, using ACCE

通过现有的人口数据结构特点，对其进行拟合分析后进行长短期的预测-Population data through the existing structural features, their post-fitting analysis of the short and long-term prediction

实用数据结构教程,让你学习数据结构不用愁,呵呵!希望这对你有用,能帮上一点忙!-Practical Guide data structure, so you learn not worry about data structures, Oh! Hope this useful to you, we can help!

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of

用电管理，用ftp编的源程序，小改一下就可以用了-electricity management, use ftp addendum to the source, small change can use this!

问题描述：设有11种不问的钱币各若干张，可用这II种钱币产生许多不同的面值。试 设计一个算法，计算给定的某个面值，能有多少种不同的产生方法。例如有1分3张，2分 3张，5分1张，则能组成7分面值的方法有：3个1分+2个2分，1个1分十3个2分，2 个1分+1个5分，1个2分+1个5分共四种。 ^编程任务：对于给定的II种不同钱币，编程计算某个给定面值能有多少种不同的产生 方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.

0-1背包问题的动态规划求解算法, 0-1背包不同于背包问题-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem

演示C++读写EXCEL的方法,简单,通过ODBC完成基本的数据库功能-Demo C++ Literacy EXCEL method, simple, through the ODBC database to complete the basic functions

poj1125用二叉堆优化的Dijkstra算法-poj1125 binary heap using the Dijkstra algorithm optimization