基于哈夫曼编码的文件压缩

大约有10种排序方法，如堆排序、快速排序、归并排序、插入排序、外壳排序、选择排序、早泡排序、线性排序、地址选择排序和基排序。我自己提出了一种简化的快速排序。-about 10 species of sequencing methods, such as heap sort, quick sort, merge, in order to insert sequencing, shell sort, select, in order of ranking as foam, linear ordering, sequencing and address choice-based ranking. I propose a simplified Quick Sort.

在 NS 2.35 启动 tcl 代码简单启动。你可以轻松学会它的形式如何 tcl 文件中的代码。什么会的参数。值。只是用户友好的代码。

经典算法之:连续邮资问题,全排列问题,有限期任务安排,整数划分问题,装载问题-classic algorithms : for the postage issue, all issues with a task deadline, integer division, loading problems

该程序为mente carlo算法 可用于电力系统的随机抽样模拟系统状态 可用于大型的电力系统计算可靠性-the procedures for mente carlo algorithms can be used for power system simulation of random system state available in a large power system reliability calculation

c#  实现的Kalman滤波算法能够很好地得到、观测和测量模型数据，你值得拥有。欢迎大家下载、试用。谢谢大家的支持！

验证hilbert矩阵是病态矩阵-Authentication is a pathological matrix matrix hilbert

采用高斯消元法实现的n阶线性方程组求解程序；-using Gaussian elimination method to achieve the n-solving linear equations;

G729的多种编解码，源码。含有测试程序。G729的多种编解码，源码。含有测试程序。

长整数的四则运算-long integers four Operational

旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 最优路线是1,3,2,4,1， 其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance between the city (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between the city optimal route is 1,3,2,4, 1, the shortest distance is 25