data clustering

索引顺序表查找,索引顺序查找即分块查找，是将顺序表分成诺干块。-Indexed sequential table lookup, the index in order to find that the search block is to the order of the table is divided into Nokan blocks.

多个Huffman编码、解码器的程序，对数据结构的学习者很有用。-over Huffman encoding, decoding device procedures, data structures useful to learners.

创建FP-Tree树的过程。从.txt文件中读取字符型数据，然后创建FP-Tree。-The creation of FP-Tree tree process. From. Txt file to read character data, and then create a FP-Tree.

这个源代码是二进制，八进制，十进制数字之间的互相转换。

一个同学的毕业设计-a student at the graduate design

题目：设计一个题目，演示用算符优先法对算术表达式求值的过程。 概要设计 1、顺序扫描中缀算术表达式，当读到数字时直接将其送至输出队列中； 2、当读到运算符时，将栈中所有优先级高于或等于该运算符弹出，送至输出队列中，再将当前运算符入栈； 3、当读入左括号时，即入栈； 4、当读到右括号时，将靠近栈顶的第一个左括号上面的运算符全部一次弹出，送至输出队列中，再删除栈中的左括号。 5、使用VS栈来存储读入的操作和运算结果，然后进行数字字符到数值的转换。 -Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical co

数据结构实验，内部排序的源码及实验报告！-Experimental data structure, the internal ranking of the report source and experimental!

unix上的TDS协议实现，实现了sybase/mssql的dblib,ctlib和ODBC-unix on the TDS protocol to achieve sybase/mssql of dblib, ctlib, and ODBC

关于数据库学习的 关于数据库学习的-shujk

本程序是一个用于管理学生成绩例子．通过利用MFC的DAO类，用VC++编写独立与DBMS的应用程序-this is a procedure for the management of the performance of their students examples. Through the use of the MFC DAO category, prepared by VC independence and DBMS applications