登录
首页 » C++ Builder » poops

poops

于 2013-01-14 发布 文件大小:2KB
0 188
下载积分: 1 下载次数: 1

代码说明:

  My realization of binary tree. This example is search tree.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • sqstack
    和线性表类似,栈也有两种存储表示:顺序栈和链栈。   顺序存储结构简称为顺序栈。和顺序表类似,对顺序栈也需要事先为它分配一个可以容纳最多元素的存储空间。 (and linear scale similar Stack also have two storage : order Stack and Stack chain. Sequence storage structure referred to as the sequence of stack. Table and order similar to the order Stack also needs prior to allocate it can accommodate a maximum of elements of storage space.)
    2007-04-18 16:43:18下载
    积分:1
  • chain
    链表的模板类,提供插入删除,遍历器,查找等功能,只有一个头文件,可以包含到你的工程(template implemention of Chain)
    2013-12-09 11:04:33下载
    积分: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
  • Campus-tour-code
    设计一个校园模拟导游程序,为新生或来访的客人通过与机器的“对话“提供最短路径的信息查询服务。(Analog design a campus tour program for freshmen or guests visiting the shortest path information services through the machine "dialogue.")
    2014-06-04 23:43:10下载
    积分:1
  • stack
    数据结构 堆栈 实现了以下功能: cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)
    2013-11-01 11:05:10下载
    积分:1
  • length
    利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度(average path lengh)
    2011-09-01 11:13:51下载
    积分:1
  • sorting
    该文件描述了排序算法的实验指导报告,通过本实验,你可以了解插入排序、选择排序、希尔排序、堆排序、冒泡、双向冒泡、快速排序、归并排序、递归的归并排序、基数排序等多种排序方法的实验(The document describes the experimental guidance of the sorting algorithm, through this experiment, you can learn about the insertion sort, selection sort, shell sort, heap sort, bubble, two-way bubble, quick sort, merge sort, merge sort recursive basesorting a variety of sorting methods experiment )
    2012-06-08 11:28:55下载
    积分:1
  • Data-structure
    数据结构的一些简单的排序算法,有利于初学者学习。(Data structure of some simple sorting algorithm is conducive to beginners learning.)
    2016-06-28 08:27:32下载
    积分:1
  • zhebanchazhao
    这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法(This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm)
    2012-05-04 00:03:29下载
    积分:1
  • Cpp1
    校园导游,可以选择景点序号来了解景点,通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)
    2012-06-20 21:57:32下载
    积分:1
  • 696518资源总数
  • 105908会员总数
  • 30今日下载