资源列表
8-queens
- 数据结构算法：回溯法编程寻找八皇后问题的所有解，使用语言C/C-algorithm data structure : backtracking programming for the Queen's eight all solutions, the use of language C / C
8Queen_Htm_Src
- 八皇后问题的HTML语言实现，可视化查看八皇后问题的所有解-eight of the Queen's HTML language, visualization eight Queen's View of all solutions
Landsoft_Src
- 数据结构链表的演示程序，实现了链表的逆序存放，供初学者学习-data structure Chain demonstration procedures, the reversal of the chain store for beginners learning
Report_Des20260710192006
- VB做的报表设计源程序,非常不错,可以自定义模版-statements do VB source design, very good, can define templates
bitsort
- 不错的排序算法。快速而且占用内存少，不过仅对不重复数据进行排序，如果出现重复，需要另加索引！-good sorting algorithm. Rapid and less memory, but only to not repeat data sorting, if duplication, and the need for indexing plus!
Liangyoudunsuanfa
- 梁友栋-Barskey裁剪算法,在裁剪算法中比较快的一种算法,-friends of Liang Dong-Barskey cutting algorithm, the algorithm cutting a faster algorithm,
bresenhamsuanfachengxu
- bresenham画线算法程序,运行环境windows xp TC2.0环境.-bresenham line drawing algorithm procedures, the environment windows xp TC environment.
vb1-1
- VB小程序很好用的，在很多的初学者圣上是十分使用的小乘许， ，大家共同学习哈-VB small procedure is useful, and in many beginners His Majesty is the Hinayana permission, we learn together Kazakhstan
Fast_Dijkstra
- 时间复杂度为O(ElogV)的Dijkrastra算法的实现，解决城市道路网的最短路径问题，可以计算1000×1000个节点。
Total_Permutations
- 任意输入一个整数n，程序将自动生成1到n之间n个数的全部可能排列。利用递归算法。-indiscriminate importation of an integer n, procedures will automatically generate between 1 to n number n of the total potential order. Recursive algorithm.
Fast_Joseph
- 时间复杂度为O(nlogn)的Joseph排列问题的计算程序。程序的运行时间与m无关。在一分钟之内可以计算n=10^6,m任意的Joseph排列问题.-time complexity of O (nlogn) Joseph problems with the program. Procedures for the running time has nothing to do with the m. In a minute can be calculated n = 10 ^ 6, m arbit
LISS_FAST
- 时间复杂度为O(nlogn)的最长单调递增子序列问题的计算程序。不是动态规划算法。在一分钟之内可以计算n=10^6个元素的递增子序列。-time complexity of O (nlogn) of the longest-monotonically increasing sequence of the program. Is not dynamic programming algorithm. In a minute can be calculated n = 10 ^ 6 elements