登录
首页 » Visual C++ » lab07

lab07

于 2013-05-12 发布 文件大小:13KB
0 233
下载积分: 1 下载次数: 2

代码说明:

  本例主要设计查找的有关算法,例如有序表的查找和顺序标的查找,顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(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.)

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

发表评论

0 个回复

  • Binary-tree-in-the-establishment
    二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表(Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list)
    2013-03-30 14:39:13下载
    积分:1
  • Sort
    排序,各种排序算法,插入排序,冒泡排序,快速排序,等等!(Sorting, various sorting algorithms, insertion sort, bubble sort, quick sort, and more!)
    2011-05-08 00:09:13下载
    积分:1
  • courseDesign
    C语言课程设计例子,迷宫的实现,包括了需求分析,概要设计,详细设计,测试,源代码等(C language curriculum design example, the realization of the maze, including requirements analysis, preliminary design, detailed design, testing, source code, etc.)
    2011-11-23 23:41:04下载
    积分:1
  • 03
    说明:  《妙趣横生的算法》第三部分原书附带代码程序,绝对属实(&quot Algorithm for fun,&quot the third part of the original program with the code, the absolute truth)
    2011-04-24 01:36:18下载
    积分:1
  • LCS
    the longest common serials
    2011-12-13 00:32:40下载
    积分:1
  • Prim
    编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。 (其中随机生成点和边,形成连通图) 根据输入的顶点数的不同,分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )
    2011-06-11 16:28:53下载
    积分:1
  • zuixiaoshengchengshu
    最小生成树C语言程序,提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)
    2015-02-08 20:15:45下载
    积分:1
  • 04huffman_a
    根据最常用的链表法进行huffman编码,可以手工预制权重,例如n=8的时候即可以在文件中写入,输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)
    2007-05-29 19:15:26下载
    积分:1
  • 插入排序
    根据所选定的字符顺序,按照从大到小的规则,对字符进行插入排序,(Insert and sort characters)
    2020-06-22 12:40:01下载
    积分:1
  • cengcipianli
    按照一定的输入求出二叉树的层次遍历,输出相应的结果(Calculated in accordance with the input binary tree traversal of the hierarchy, the output of the corresponding results)
    2012-06-08 21:44:41下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载