-
各类排序算法比较
本代码实现并比较了直接插入排序，选择排序，冒泡排序，快速排序，两路合并排序，堆排序，同时可视化比较了他们的时间复杂度，代码完整可行，有可执行文件直接运行。
- 2022-10-10 13:35:03下载
- 积分：1
-
拉格朗日乘子法
说明： 这篇文章详细介绍了拉格朗日乘子法的原理及其相关知识。(It introduces the principle and relevant knowledge about lagarange multiplication in detail.)
- 2020-12-10 21:33:52下载
- 积分：1
-
radixsort
对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)
- 2007-10-16 19:11:53下载
- 积分：1
-
exchange
这是一个二叉树左右子树交换的简单程序，希望对大家有用！(This is a binary tree so the simple sub-tree exchange procedures in the hope for all of us!)
- 2009-10-16 21:02:19下载
- 积分：1
-
small-True
最小生成树C语言代码 最小生成树C语言代码(small tree small tree small tree)
- 2012-11-24 22:55:00下载
- 积分：1
-
BinarySearchTree
在Visual Studio 2008运行成功 数据结构 二叉查找树的类(In Visual Studio 2008 running a successful binary search tree data structure classes)
- 2013-07-23 22:04:29下载
- 积分：1
-
Maze-code
以一个m×n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。首先用二维数组存储迷宫数据，迷宫数据由用户输入。一个以链表作存储结构的栈类型，然后编写一个求解迷宫的递归或非递归程序。求得的通路以三元组（i，j，d）形式输出，其中：（i，j）指示迷宫中的一个坐标，d表示走到下一坐标的方向（东、南、西、北四个方向所用代表数字，自行定义） (With an m × n the long square maze, 0 and 1, respectively maze of pathways and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or come to the conclusion there is no path. First of a two-dimensional array to store the data maze, maze data input by the user. A linked list storage structure for stack type, and then write a recursive or non-recursive solving the maze procedure. Obtained access to triples (i, j, d) in the form of output, of which: (i, j) indicates the maze of a coordinate, d represents the coordinates walked next direction (east, south, west, north four directions used on behalf of a digital, self-defined))
- 2014-01-20 15:41:40下载
- 积分：1
-
b
说明： 定义一个类SortArray继承自MyArray，在该类中定义函数sort实现排序功能。
定义一个类ReArray继承自MyArray，在该类中定义函数reverse实现逆转功能。
定义一个类AverArray继承自MyArray，在该类中定义函数Aver实现求解整数的平均值。
定义NewArray类，同时继承了SortArray、ReArray和AverArray，使得NewArray类的对象同时具有排序、逆转和求平均值的功能。在继承的过程中声明为虚基类，体会虚基类在解决二义性问题中的作用。
(Define a class SortArray inherited from MyArray, defined in the class sorting function sort implementation. Define a class ReArray inherited from MyArray, define the function in reverse to achieve such reversal function. Define a class AverArray inherited from MyArray, defined in the class to solve integer function Aver achieve the average. Defined NewArray class, and inherits SortArray, ReArray and AverArray, making the object of both NewArray class sorting, reversing, and the mean value of the function. In the process of succession declared as virtual base classes, virtual base class experience in resolving ambiguities of the role.)
- 2010-06-02 02:13:03下载
- 积分：1
-
data-structure
考研计算机用得到。
数据结构笔记参考资料来源：严蔚敏数据结构教材及题集全真题解数据结构分册
北邮数据结构考研指导算法设计与分析（研究生教材）算法与数据结构（研究生教材）
众网友来信及讨论从其它途径收集的历年真题以严的教材及题集为主，其它参考资料为辅！数据结构笔记主要内容：
基础知识：基本问题问答（概念）
算法分析：教材典型例题算法思路简述
算法设计：严题集一题多解，典型题详细分析
重点题分析：严每章题集已经考题，相似题数据结构笔记特点：
实用，详细，易于理解（用通俗语言描述复杂问题），针对性强，覆盖面广，定期公布，题目累加！
(Kaoyan computer with. Data structure notes refer to data sources: Yan Wei Min data structure textbooks and problem sets full Zhenti solution data structure volumes BUPT data structures Kaoyan guidance algorithm design analysis (Graduate textbook) algorithm and data structure (Graduate textbook) all the users a letter and to discuss other ways of collection of the years Zhenti strict lecture notes and problem set-based, supplemented by other references! Data structure notes: the basics: basic questions Q & A (conceptual) algorithm: a typical textbook example algorithm ideas outlined algorithm design: Yan title set more than one title solution, the typical question a detailed analysis of the focus question: Yan Each chapter problem sets have been exam, similar to the title data structure notes features: practical, detailed and easy to understand (in simple language to describe complex issues), targeted coverage of a wide range of regularly published entitled accumulate!)
- 2012-07-20 22:57:18下载
- 积分：1
-
DisplayBTree
代码注重B树插入、删除的算法逻辑，适用于
学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )
- 2006-07-19 00:00:38下载
- 积分：1
