Fugit calculation method of binary tree options use Fugit binomial tree to calcu...

在设计会计软件时,常常要把小写金额转换为大写金额,通过本例,你只要输入小写数字,即可转为大写金额.-accounting software in the design, it is often the amount should lowercase to uppercase conversion rates, through the cases, as long as you input lowercase figures, the amount can be converted to uppercase.

0-1背包问题，用VC++实现，是算法设计中比较重要的问题-0-1 knapsack problem, using VC++ Realize is that algorithm design more important issue

数据结构-次索引的建立-data structure-building meeting Index

这是我的一些数据结构(C语言)源代码 比如LinkList，String，Array，Tr-This is some of my data structure (C Language) source code for LinkList, String, Array, Tree, etc.

创建一个链表，逆向输出链表，两个链表的合并的vc程序编程实现代码。-create a linked list, reverse output chain and the two combined Chain vc programming code to achieve.

矩阵求逆的c++程序,用来算大规模带分数形式的逆矩阵的,文件输入-matrix inversion c procedures for the large-scale Daibanshu form of the inverse matrix, the file input

数据结构中，关于一元多项式的加减乘求导等算法的实现-Data structure, on the one polynomial addition and subtraction, such as by derivation algorithm

伙伴系统:avail[0..m]为可利用空间表, n为申请分配量, 若有不小于n的空闲块, 则分配相应的存储块, 并返回其首地址,否则返回NULL -Partner system: avail [0 .. m] can be used for table space, n for the distribution of the volume of applications, if n is not less than the free block, then the distribution of the corresponding storage block, and return to its first address, otherwise return NULL

运动会分数统计系统 数据结构的课程设计-Games scores of statistical systems data structures curriculum design

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri