LCS

使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。 具体的要求： 1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码； 2．将给定编码文件译码，生成字符，输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)

大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)

A*算法通过启发式探索下一结点，逐步逼近目标结点，且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)

太阳能电池参数计算，可以快速方便计算电流，电压，填充因子等参数(Solar cell parameter calculation)

改进爬山算法，用于风力发电机实现风能最大追踪，找到最佳叶尖速比，实现最大功率(modified hill-climbing algorithm for wind turbine with MPPT)

说明：  一个实现外部排序的程序，其中gnerate.cpp为产生一个随机的文件，用于被排序。而caculate.cpp为外部排序程序。(A realization of the external sort program, which gnerate.cpp to generate a random file for be sorted. The caculate.cpp external sort program.)

链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through )

说明：  离散随机线性系统的卡尔曼滤波。 其中13lman.c是卡尔曼滤波函数，4rinv.c是滤波函数中用到的矩阵求逆函数，13lman0.c是主程序。(discrete stochastic linear Kalman filtering system. 13lman.c which is the Kalman filter function, 4rinv.c filtering function is used in the matrix inversion function, is the main program 13lman0.c.)

B-树的创建、插入、删除等一系列操作！(B-tree creation, insert, delete a series of manipulations!)

二叉树的操作，涉及到三种顺序的遍历，树的凹入表示法，转化为一维数组储存，节点的计数，以及中序线索化。(Binary operation, involving three kinds of the order of traversal, tree concave representation into a one-dimensional array of storage, the node count, as well as in the threaded sequence.)