资源列表
unify
- unify算法 人工智能 机器学习 C语言实现 -artificial intelligence algorithms unify
satg
- 二叉树的建立和遍历c++语言非递归和递归实现-The establishment and traverse binary tree c++ language implementation of non-recursive and recursive
Treap
- Treap C++模板类 实现了treap数据结构 同时具有堆和二叉树的性质-Treap C++ template class implements the treap data structure of both the nature of the heap and binary tree
find-the-maximum-value
- find the maximum value，找出一组数据的最大值。-find the maximum value
b_search_tree
- c++实现的二叉查找树的相关操作，有二叉树的简历，插入，删除，查找，遍历-C++ realization of binary search trees of the relevant operation, have binary tree resume, insert, and delete, find, traverse
prim_mst
- prime最小生成树,数据结构，图论算法-prime MST
pre
- 以先序之方法遍历二叉树，以递归方法和非递归方法分别实现。-To preorder tree traversal methods to recursive methods and the realization of non-recursive method, respectively.
structures
- structures programs source code
Collide
- 不同势能函数下的散射截面的c++程序算法-Different potential energy function of the scattering cross section under
zhan
- 1、用栈实现10进制，转其它进制的算法，要求输入一个10进制整数和需要转换的进制，输出转换后的结果。 2、用栈完成括号匹配检验程序。 3、用递归求n!。-A base 10, using the stack, turn the other hex algorithm asked to enter a decimal integer, and the need to convert the hex output conversion results. Match the test pr
DynamicInput
- 实现对列表的动态操作，包括插入，删除等基本功能。
Joseph
- 有关著名的约瑟夫问题，用了三种方法，链表，公式化描述和虚拟指针-Joseph, the well-known problem, with the three methods, lists, descr iptions and virtual pointer formulaic