字符串比较

该代码实现了am，f-msk，qpsk，mdpsk-the code achieved am, f-msk, qpsk, mdpsk

不但要输出频繁模式，还要输出频繁模式的支持度（绝对值，即支持度计数）输出文件中每行格式如下：abc: 1000表示输出模式为abc，其支持度为1000

这是一个用c++编写的k-mean程序，完全能够实现聚类算法，可以帮助大家学习c++和聚类算法！

particle filter using SIR

Gauss_Seidel迭代-Gauss_Seidel

Huffman编码是常见的编码之一，它的一个重要应用即为实现文件的压缩。本程序实现了利用Huffman编码进行文件压缩与解压缩

Contains Clustering Mechanism. especially, Cluster Header Selection is focused.

c语言编写数学常用算法--commonly math algorithm written in C language

Dijkstra算法与Floyd算法的matlab实现，以求解最短路问题-Dijkstra algorithm and Floyd algorithm matlab realize in order to solve the shortest path problem

设A和B是2个字符串。要用最少的字符操作将字符串A转换为字符串B。这里所说的字符操作包括： 1. 删除一个字符 2. 插入一个字符 3. 将一个字符改为另一个字符 将字符串A变换为字符串B所用的最少操作数称为A到B的编辑距离，极为d(A,B)。设计一个算法，计算任意两个字符串的编辑距离。 -Set A and B are two strings. Operation will use the least character string A is converted to a string B. Operation of characters are talking about here include: 1. Delete a character 2. Insert a character 3. Will be replaced by one character to another character will be transformed into a string A string of at least B operand used by A to B is called the edit distance is extremely d (A, B). Design an algorithm to calculate any two of the string edit distance.