-
48qqqq
主要用栈和树求解骑士问题,用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
- 2009-03-21 22:34:39下载
- 积分:1
-
lab07
本例主要设计查找的有关算法,例如有序表的查找和顺序标的查找,顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
- 2013-05-12 22:01:58下载
- 积分:1
-
sort
归并排序,复习排序算法,在不同环境下,寻找时间复杂度最少的排序算法(
Merge sort, review sorting algorithm, in different contexts, looking for the least time complexity of sorting algorithm)
- 2013-11-05 22:15:57下载
- 积分:1
-
BDX
设计、编写和调试面向对象C++程序,实现任意两个同类数据比大小
的通用函数(模板),涵盖普通数值型数据之间的比较、两个字符串之间的比较
(按字典序)、两个复数之间的比较(按模大小)等,并通过主函数加以调用和
测试。(Design, writing and debugging of object-oriented C++ procedures to achieve similar data than the size of any two generic functions (template), covering general comparison between numerical data, the comparison between the two strings (lexicographically), two Comparison between complex numbers (modulo the size), and through the main function to be invoked and tested.)
- 2020-11-28 13:49:29下载
- 积分:1
-
abc
数据结构的稀疏矩阵的几部分操作,广工的课程设计(Sparse matrix operations)
- 2013-12-03 15:57:53下载
- 积分:1
-
PRIM
PRIM算法 对任意给定的网和起点,用PRIM算法的基本思想求解出所有的最小生成树。(PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.)
- 2009-01-11 19:05:21下载
- 积分:1
-
DouglasPeucker
道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)
- 2011-08-28 19:04:29下载
- 积分:1
-
heapsort
说明: 从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
- 2008-11-11 22:53:42下载
- 积分:1
-
c++
一款可以排序的小程序,希望大家可以看一下(A sort of small program, I hope you can look at it)
- 2017-12-13 20:06:55下载
- 积分:1
-
mathandos
算法设计的动态规划,贪心算法
操作系统的银行家算法等五个小程序(data)
- 2009-12-27 17:06:43下载
- 积分:1