visual basic 文件数据基

分治的思想 归并排序 分治是很重要的方法 归并排序是一种快速的排序-Divided ideological merge sort is very important sub-rule method is a quick sort merge sort

利用mfc和opengl编译的圆的绘制代码，里面有两个主要是利用扫描射线和多边形接近法

数据结构的课程设计---稀疏矩阵运算器 希望可以给大家参考-data structure design of the curriculum-- for sparse matrix operations can hope for your reference

Java数据结构和算法（第二版）-lafore著，教材中的范例程序，用JAVA语言，-Java data structures and algorithms (second edition)-lafore, and textbook examples of procedures, using JAVA language,

test1.txt中为要读入的英文文章，code.txt为生成的huffman编码，decoded.txt中为根据code.txt中内容解码后的结果。-test1.txt is used to store the article in English to be read, code.txt contains generated the huffman codes, decoded.txt for the contents according to code.txt decoded results.

有关数据库编程的方法-the database programming method

1．定义串的顺序存储结构。 2．编写函数实现串的初始化、分配、取子串算法 3．编写函数据实现串的模式匹配-1. The definition of the order of string storage structure. 2. The initialization string write function implementation, distribution, taking sub-string algorithm 3. Write a function, according to string pattern matching to achieve

利     实现功能：用给出的字符数及个字符频度，对其建立哈夫曼编码，并用此哈夫曼编码表对给出的字符串进行编码、对给出的代码进行译码。          （1）       初始化Initialization.从终端读入字符数n 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (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.

思想很简单，就是一个循环链表 但要说明的是：我之所以用clist(1)来初始化，主要是我刚开始编的时候没打算解决约瑟夫环，只是想编一个带表头的循环链表，然后我用从这个程序改过来的，所以代码可以进一步优化。-Thinking is very simple, that is, a cycle list but would like to note is: I use clist (1) to initialize, mainly because I had just started when Joseph did not intend to resolve the ring, just want to provision a table with the head circulation list, and then I used to come from this process, so the code can be further optimized.