资源列表
RF_trainingCourse2011
- COMSOL MULTIPHYSICS 最新的培训文件。适合于4.3 版本-The COMSOL Multiphysics latest training documents. Suitable for version 4.3
CPP-hafuman
- 采用C++实现了数据结构中常见的哈弗曼方法的编码。-C++ achieve a common data structure Hafu Man method of encoding.
LSSVMLab-1.6
- 模糊PID算法(C++) 温度控制的一般控制算法,Kp,Ki,Kd,需根据具体的控制对象取合适的值-Fuzzy PID algorithm (C++,) the general control algorithm for temperature control, Kp, Ki, Kd, to be based on a specific control object to take the appropriate value
linkedlist
- 基于C++的链式表的建立,插入节点,删除节点等功能。-Based on the establishment of C++ chain table, insert node, delete node function.
1.txt
- 高精度计算大数据的阶乘,再也不怕阶乘后出来的数据大了-High-precision calculation of the factorial of large data, no longer afraid of factorial data
MyTest01
- 检索一串字符串中的每个字符的个数,别且输出-Retrieve a bunch of strings in the number of each character
Bttwotreesi
- 二叉树的数据结构算法 包括二叉树的创建建、遍历、输出等,可以作为课程设计的原材料 -Binary tree data structure algorithms created to build, including the binary tree traversal, output can be used as the raw materials of the course design
Beerchashui
- 二叉树的C++代码 用处很多的哦 尤其对那些正在学学数据结构的同学而言 ,经测试可直接使用。 -Binary tree C++ code useful, a lot especially for those students is to learn the data structure has been tested and can be used directly.
Ferraru
- 通过编写函数实现特殊二叉树的操作,是特殊殊二叉树的插入、删除比一般的二叉树效率更高 -Special binary tree operations by writing function is a special special binary tree insert, delete, higher than the general efficiency of the binary tree
SolvedHZIEE
- 杭州电子科大hdu poj 上面水题的答案,供不辞辛劳、努力刷题的同学们参考学习。-The above Hangzhou the UESTC hdu poj, water the answer for tirelessly to brush the question of the students for reference.
ACM-Template
- ACM常用的算法、数据结构模板,清晰明了,常用的树、图论、数论等都包含在内-ACM commonly used algorithms, data structures, templates, clarity, common tree, graph theory, number theory and so contains
avlTree
- AVL 树是一种常见的数据结构,所谓的二叉平衡树,这里是一个简单实现,算法效率可能并不太高,因为只是简单实现,方便大家学习使用-AVL tree is a common data structure, the so-called binary balanced tree, here is a simple implementation of the efficiency of the algorithm may not be too high, because only a simple imp
