资源列表
UVaOJ
- UVaOJ上的volume0到volume1的大部分有点难度的题，太水的题目源码没包括。还包括volume2开始的链表方面的题。全是自己写的源码，全部在UVaOJ上AC了，包含注释。-Volume0 to volume1 bit difficult UVaOJ majority on questions, the subject of too much water source not included. The list also includes aspects title volume2
AES算法的C语言实现
- AES算法的C语言实现，希望对大家有用，我在ARM_Cortex M3实现了
polynomials
- 用单链表作为存储结构，实现多项式的乘法与加法- As a single linked list storage structure, polynomial multiplication and addition
Huffman-coding-tree
- 用二叉树作为存储结构，实现霍夫曼树的编码以及01序列的解码-As with binary storage structure, to achieve Huffman coding tree
Simple-calculator
- 用栈实现简单的加减乘除，并且可识别优先级及括号-Using stack to achieve simple arithmetic
The-minimum-distance
- 运用图的存储表示，求出最小距离出建立医院- Storage use map, said the establishment of the hospital obtained a minimum distance
distribution_judge
- 判断数据处于什么分布状态，有些数据参数需要自己设定-Determine what data is distributed state, some data parameters need to set their own
homework1
- C语言学生信息管理系统，算法与数据结构作业-C language student information management system, algorithm and data structure operations
list
- 单向链表，2nd插入节点，尾部插入节点，顺序插入节点，删除节点，遍历节点-list,insert list,delete list
haffuman-for-students-imformation
- 数据结构内容，使用哈夫曼树存储学生信息，适用于VC 和C-Data structure of the content, use the Huffman tree to store student information for VC and C++
inder
- fog removal ALGORITHM BY PIT AMRITSAR MATLAB CODE
yoseph
- 严蔚敏《数据结构(c语言版)习题集》实习题答案-YanWeiMin " data structure (c language version) Problem Set" internship answer questions