比较六种排序算法，其中包括快速排序，冒泡排序等内容的速度以及空间复杂度。...

分类器是对每一个输入模式赋予一个类别名称的软件或硬件装置，而贝叶斯分类器是各种分类器中分类错误概率最小或者在预先给定代价的情况下平均风险最小的分类器。它的设计方法是一种最基本的统计分类方法

有关java的一个简单树，显示树结构，程序很简单。-the java a simple tree, the tree structure, procedure is very simple.

数据结构课程设计内部排序的比较 一共有十种排序方法-Curriculum design of internal data structure to sort of comparison a total of 10 kinds of sorting methods

这是一个用回溯算法解0--1背包问题的C++程序（好用的）-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)

数据结构自考试题及答案 希望能够帮助大家-Data structure questions and answers to help everyone

一种基本算法！ 现有一个酒店有100个房间，依次编号为1到100，第一个服务员经过，将所有房间门关上；第二个服务员经过将所有编号为2的倍数房门打开；第三个服务员经过将所有编号为3倍数的房门打开的关上，关闭的打开。依此类推；输入一个100以内的正整数N，输出第N服务员经过之后，所有房间的状态。-a basic algorithm! An existing 100 hotel rooms, followed by No. 1-100, after an attendant, all rooms will be closed; Second attendants after all No. 2 in multiples door open; Third attendants after all No. 3 multiples of the open door is shut, Guan the opening closed. XII; The importation of a hundred within the positive integer N, N output after attendants, all rooms in the state.

最大流问题的最短增广路径算法 是算法中的重要部分 -Maximum flow problem of the shortest augmenting path algorithm is an important part of the algorithm

该系统为订单系统，用于管理订单信息-orders for the system, information for the management of orders

伙伴系统:avail[0..m]为可利用空间表, n为申请分配量, 若有不小于n的空闲块, 则分配相应的存储块, 并返回其首地址,否则返回NULL -Partner system: avail [0 .. m] can be used for table space, n for the distribution of the volume of applications, if n is not less than the free block, then the distribution of the corresponding storage block, and return to its first address, otherwise return NULL

表达式求值 文本界面-expression evaluates text interface