可用的用matlab求解非线性微分方程组的牛顿迭代 hypearink-optimized

二叉树的基本操作-binary tree as the basic operation

给一串数字或字符进行排序，给一串数字或字符进行排序。-paixu

该程序利用c语言在DOC环境之下实现了简单的湖南吉首大学校园导游系统，方便学生学习。(The program using c language environment in DOC under realized simple JiShou hunan university campus guide system, convenient student learning. )

找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。(Find the longest increasing sequence)

清华大学数据结构 严蔚敏 PPT+习题答案-Tsinghua University, Yan Wei-min data structure PPT+ Exercises Answer

vSQL server　的教务管理系统-vSQL server management system for the Senate

Database Viewer application. Allows you to view and scroll through all of the records in a database.

这是学生信息系统项目。你可以做以下事情1.添加记录2.清单上做好记录3.修改记录4.删除记录5.退出程序用来存储数据文件

设计一个算法，按照深度优先遍历的思想找出从指定结点出发，长度为M的所有简单路径。并将此算法用于邻接表类，在邻接表类中定义一个共有成员函数find(start, m)。(In adjlink to class with negative right value realization monosource shortest path function. Design an algorithm, according to traverse the depth first thoughts from specified node to find out, based on all of the simple length for M path. This algorithm is used for adjlink to class, defined in the class in adjlink to a mutual member function find (start, m).)

通过该程序实现huffman编码，解码。输入一段字符串，统计字符出现频率，输出huffman编码。输入一段编码，根据预先设定的解码方式进行解码。-Through the process to achieve huffman encoding and decoding. Enter a string, statistical character frequency, the output huffman coding. Enter a code, based on pre-set decoding method to decode.