帐户软件

数据结构电子书,清华大学出版社,严蔚敏老师-Data Structure e-books, Tsinghua University Press, YAN Wei-min Teachers

基于Visual C++开发的，关于电梯工作过程的模拟的程序源代码。电梯模拟-Based on Visual C++ Developed in the course of its work on the elevator simulation program source code. Elevator Simulation

利用深度遍历的方法来检查8数码问题是否有解。-use depth traverse method to check whether the eight digital solutions to the problem.

一个数据库操作类，开发语言为C#。适用于SQL_Server和ACCESS.-It is the operateing class of database developed C#,and it is suit for SQL_Server and ACCESS.

严蔚敏编写的《数据结构》第10章的答案，全部为源码-the answers of chapter 10 of a book called ‘Data Structures’ writen by Yan Wei Min

实例有关说明： 数据源：本实例使用的数据源在本章实例MyOdbcSmpl目录中，数据源为ACCESS数据源，数 据文件为Mydb.mdb。请根据本章2.4.1创建ODBC数据源中所指示的ODBC数据源管 理器（ODBC32.exe）来创建和配置数据源MyDB（也可以命名为其他名称）。 执行结果：本章实例的执行结果MyOdbcSmpl目录中的可执行文件MyOdbcSmpl.exe。在数据 源中选择刚配置的MyDB，在数据表或视图中选择要查询的表或视图，选择查询的 列，如果有查询条件，请在查询条件中输入，最后确定是否输出显示查询结果， 缺省为显示，单击“执行”按钮，执行查询并显示查询结果，在SQL语句框中显 示执行的查询。-Note : Data Source : The data used by the examples in this chapter source directory MyOdbcSmpl example, ACCESS data source for data sources, data files for Mydb.mdb. Requests under this chapter 2.4.1 create ODBC data source as directed by the ODBC Data Source Manager (ODBC32.exe) to create and configure data sources MyDB (also named other names). Outcome : examples of this chapter MyOdbcSmpl results of the implementation of the directory MyOdbcSmpl.exe executable files. The data sources to choose just the MyDB configuration, the data in Table View or choose to check the table or view, the choice for the series, if there are inquiries conditions, the conditions for the imp

HUFFMAN树的构造算法，求最佳二元码并能借助二元码进行编码和解码。-Huffman Tree Construction Algorithm, and the best use of binary code and binary code encoding and decoding.

伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree

Object-Oriented Modeling with PowerDesigner 9.5 不错的学习教案-Object-Oriented Modeling with PowerDesigner 9.5 good learning lesson plans

[问题描述] 将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N） [输入] 待排序记录个数，各关键字的值。 [输出] 关键字从正负分开，正数在前 [存储结构] 待排序记录顺序存储。 [算法的基本思想] 快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。 #include using namespace std #define MAXNUM 100//设文件的最长可能长度 void sort(int* keys, const int len)//排序 -[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword