非递归八皇后问题。以前大家常见的是递归的，现在传个非递归的-Queens eight non - recursive problem. Before we often are recursive, and now-non - recursive 下载
|
八皇后问题的非递归解决方案，适合于初学数据结构的人士进行学习。- 下载
|
文件夹中包括常用的数据结构的算法，包括二叉树的三种递归和非递归算法，染色问题，八皇后问题，深度广度遍历，约瑟夫环，数值转换，树的高度和叶子节点数，最小生成树 ，两点之间的所有路径-folder include common data structure of the algorithm, including the three binary tree recursive and non - recursive algorithm, Dyeing, 8 Queen, depth and breadth traversal, Josephus, numerical conversion, tree height and leaf nodes. the minimum spanning tree, all between the two paths 下载
|
软件简介： 那个老掉牙的问题，八皇后问题，老归老，但我很喜欢，并试图用各种方法来实现求解，出乎意料的是，同样的算法，非递归实现的速度竟然比递归实现慢！下面是当时关于算法一些说明，是用Java实现的，不过用C还是J在思想上都是一样的， -software Profile : that long-standing problems, 8 Queens problems and old to the old, but I like and and trying to use various means to achieve solution, surprisingly, the same algorithm, Non - recursive achieve speed as high recursive slow! Below are some of the time on the algorithm that is used Java, but with C or J ideologically are the same. 下载
|