oledb的例子，在pda上好用

约瑟夫问题的一个解法，主要利用数组来解决，代码为C++源代码。-Joseph A solution, the main use of the array to resolve the symbol C++ Source code.

数据结构的课后练习-Data structure of the after-school practice

ADO MD 程序员参考手册 书籍语言： 简体中文 书籍类型： 程序设计 授权方式： 免费软件 书籍大小： 808 KB -ADO MD programmer"s reference manual books Language : English books categories : program design license : free software books Size : 808 KB

基于java开发的OS中经典PV算法：生产者和消费者算法的演示。-Java-based OS development of PV in the classical algorithm: algorithm for producers and consumers of the presentation.

面试经常遇到的大数相乘问题，代码简洁易懂-Interviews are often encountered in large numbers multiply problems, the code easier to understand

迷宫算法,找出较优的路径,找到出口.算法效率比较高-maze algorithm to find the optimum path, finding an exit. More efficient algorithm

磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn

功能实现：1).输入，显示各个学生信息 2)．根据学号，姓名查找某个学生的成绩 3)．修改学生信息 4).删除学生信息 5） 清空数据库6）选择范围的输出学生成绩排名。-Function achieve: 1). Input, display individual student information 2). According to Student ID, name to find a student" s achievement 3). Modified Student Information 4). Remove Student Information 5) Clear the database 6) Select the output range of student achievement rankings.

huffman树 我自己做的 比较简单 希望大家给予完善 -Huffman tree I do a simple hope that we can give sound

根据贪心算法，来求解最小生成树； 这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree this situation, it may not seek the global optimal solution is not, however, you can find the optimal solution under the current situation