cyber_cafe管理

数据结构典型算法实现，c实现二叉树的遍历以及赫夫曼编码-data structure typical algorithm, c achieve the traversal of a binary tree Huffman coding

卡耐基 梅隆大学软件工程 第七门课程数据库管理系统ssd7 练习3-Carnegie Mellon University Software Engineering VII Database Management System course ssd7 practice 3

生成图文并茂的word文档-Generation illustrated word document

一款手机销售管理系统 数据库采用 access 2-A mobile phone sales management system database using access 2000

无线实时仓库管理系统 (ADO+ACCESS)-Wireless real-time warehouse management system (ADO+ ACCESS)

程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ，1≤i≤n 程序存储问题要求确定这n 个程序在磁带上的一个存储方案，使得能够在磁带上存储尽可能多的程序。 编程任务： 对于给定的n个程序存放在磁带上的长度，编程计算磁带上最多可以存储的程序数。 数据输入：由文件input.txt给出输入数据。第一行是正整数n，表示文件个数。接下来的1 行中，有n 个正整数，表示程序存放在磁带上的长度。 结果输出: input.txt output.txt 6 50 5 2 3 13 8 80 20 -program storage problem : There n procedures (1,2, ..., n) to be stored in the length of the L tape. I kept in the proceedings on the tape length is Li, 1 i n storage procedures to seek to establish that n procedures on tape storage of a program that allows the tape to store as much as possible the procedure. Programming tasks : to the n procedures stored in the tape length, calculated programming on tape can store up to the number of procedures. Data input : from the document input.txt given input data. The first line is a positive integer n, said the document number. Following a visit, n is an integer, said procedures stored on tape length. Results output : input.txt output.txt 6 50 5 2 3 13 8 80 20

b tree how to operate on b tr-b tree how to operate on b tr

在数据结构中编程实现表达式求值算法（加减乘除）-Structure in the data evaluated the expression programming algorithm (calculation)

数据结构中最小生成树的C语言实现源代码，需要的可以下载，只适用于初学者。-Minimum spanning tree data structure in the C language source code, need can be downloaded, only applies to beginners.

自己写的四皇后问题的算法，其中的注释非常的详细，请多指教-himself wrote four of the Queen"s algorithm, which is very detailed notes, please enlighten