数值计算源代码来自哈尔滨工业大学计算机学院

用ODBC对数据库实现连接 显示数据 修改数据-Using ODBC to connect to the database display data modification of data

C++数据库管理源代码，连接数据库后，可直接调用里面的函数对数据库进行操作，有修改-C++ Database management source code, database connectivity, you can directly call the function inside the database operation, has modified

数据挖掘（概念与技术）书上的apiori算法实现。apiori剪枝算法使用候选项集产生发现频繁项集。-Data Mining (conceptual and technical) in a book apiori algorithm. apiori pruning algorithm uses candidate item set generated frequent itemsets found.

本例主要使用的是PictureBox控件在数据库表显示上的应用。-the cases are used mainly PictureBox control in a database table shows the application.

别处找来的红虎日记源代码-elsewhere When a red tiger diary source code

list方法,包含创建list和创建节点-function of list

程序存储问题:设有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

使用BTREE索引方法开发的ISAM数据库系统-ISAM database system which is developed by using BTREE index method

图的相关操作：建立图，图的遍历，查找元素，删除元素等-Map-related steps: the establishment of map, graph traversal, find elements, delete elements, etc.

本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source