登录
首页 » Visual C++ » 03

03

于 2011-04-24 发布 文件大小:4KB
0 213
下载积分: 1 下载次数: 0

代码说明:

说明:  《妙趣横生的算法》第三部分原书附带代码程序,绝对属实(" Algorithm for fun," the third part of the original program with the code, the absolute truth)

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

发表评论

0 个回复

  • suanfa
    匈牙利算法以及指派问题介绍,kM算法和匈牙利算法的程序代码(Hungarian algorithm and the assignment problem introduced, kM algorithm and the Hungarian algorithm code)
    2011-09-10 09:42:39下载
    积分:1
  • LR(0)
    简单LR语法分析程序自动生成器的实现,可用作数据结构课程设计(LR (0) grammar analysis)
    2013-09-22 09:26:25下载
    积分:1
  • sad
    编程 主范式 使用真植表 用栈的应用 使用了 后缀表达式 (biancheng zhu fanshi)
    2012-06-18 14:16:30下载
    积分:1
  • paixu
    2008软件公司面试题:排序大全:简单选择排序、冒泡排序、选择排序、shell排序、快速排序、插入排序、堆排序(从小到大)、归并排序(利用递归)(2008 software companies face questions: Sort Guinness: simple choice to sort, bubble sort, select sort, shell sort, quick sort, insert sort HEAPSORT (from small to large), Merging Sort (recursive))
    2008-12-10 16:53:40下载
    积分:1
  • Poly
    多项式相加的数据结构试验·············(Polynomial sum test data structure)
    2010-12-24 15:11:55下载
    积分:1
  • ECSBL
    说明:  该程序实现二叉树的遍历功能,能够打印出二叉树的节点(The program realization of the binary tree traversal function, is capable of printing out the binary tree node)
    2008-11-13 15:50:49下载
    积分:1
  • 1
    说明:  可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)
    2013-11-13 21:16:53下载
    积分:1
  • Maze
    实现迷宫搜索程序。迷宫数据从文件输入。输出迷宫路径。 a) 实现从入口到出口的输出顺序; b) 能否打印行走方向(向左、向右、向前), 如: 1 先前 2 向右 6 向左 7; (Maze searching)
    2011-12-20 20:59:04下载
    积分:1
  • beipaowenti
    背包算法的c++简单实现,很有用的,可以看看(Knapsack algorithm)
    2012-04-10 19:32:41下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载