资源列表
Fresnel_Integrals
- Compute Fresnel integrals C(x) and S(x)
selectort
- 通用选择法排序C++源程序，例程为电脑随机数排序。-Sort the universal selector law Sort C++ source, routine computer random number.
LDSComplex
- Simple C++ library for complex numbers arithmetic
hebinglianbiao
- 设A与B分别为两个带有头结点的有序循环链表（所谓有序是指链接点按数据域值大小链接，本题不妨设按数据域值从小到大排列），list1和list2分别为指向两个链表的头指针。请写出将这两个链表合并为一个带头结点的有序循环链表的算法。-Let A and B are two ordered circular list with a header node (the so-called orderly clicking the link refers to the size of the data fie
Prim
- Prim算法，包括详细的容错机制，且可对非连通情况做处理。-Prim algorithm, including detailed fault-tolerant mechanism, and can be done to deal with the situation of non-connectivity.
Match
- 对任意文本进行括号匹配，提示错误行数和列数。-For any matching text in brackets, indicating the error number of rows and columns.
BiTree
- 我自己做的一个二叉树，供大家来参考，有什么不足的地方请自行改正-I do a binary tree for everyone to reference, what deficiencies to correct your own
BinaryTree
- 二叉树的基本实现（前序中序构造，后序中序构造，前序中序后序遍历）-The basic binary tree implementation (pre-order in the order structure, sequence after sequence of construction, pre-order in the post-order traversal order)
The-Poly
- 内容为用起泡排序法实现元素的非递减排列.构造一颗二叉排序树并实现其中元素的插入和删除。即先输入一串数据（int型），使计算机构造出一棵二叉排序树（限于C语言的表达，咱不在屏幕上使其输出）。然后按照屏幕提示，删除一个已有的数据，再构成一个新的二叉排序树。-Construct a binary sort tree and which elements insertions and deletions.To enter a string of data (int type), the computer
trie
- c++实现的一个trie树，可以实现插入、查找和遍历打印。-c++ implementation of a trie tree, you can achieve insert, search and traversal printing.
sort
- 说那么多有这么用，自己看下不久知道啦，很不错的sort-Good sort code
ybl_and_or
- Reverse Polish parenthesis + and + or achieve the realization of the principles of the understanding Reverse Polish helpful-Reverse Polish parenthesis+ and+ or achieve the realization of the principles of the understanding Reverse Polish helpful