- CommMonitor 是我搜集的串口监视工具可以调试232或485虽说是测试版但还比较好用
- wenben 这是QT变成中文本框的部分代码
- mschart Use VBA code to make a quiz score histogram in Excel Description This example shows how to use VBA code to make a quiz score histogram in Excel.
- test2 参看实验教程P44的“3.程序填空”
- zuixuanminzufeng 用matlab的编程实现一首歌曲的播放
- suanpingjunfenpaixu c语言
资源列表
BinaryNode
- 数据结构二叉树例子讲解，包含二叉树的各个函数的详细应用，浅显易懂-Binary tree data structure examples to explain in detail the various functions of the application contains a binary tree, easy to understand
tomswan
- 来自Tom Swan的高质量通用数据结构算法，值得学习。-The source code of data structure from Tom Swan, it s very helpful.
ACM
- 初学ACM，整理的各种排序算法，效果都不错，希望给大家有帮助。-Beginner ACM, finishing various sorting algorithms, results are good, we hope to help.
TestQSort
- 快速排序算法,C++操作重载例子 在VS2005上面直接编译通过-Quick sort algorithm, C++ operator overloading example
data_structure_algorithms_using_c
- 数据结构经典问题求解（C语言算法实例）比较详尽-The solutions to classical problems in data structure course(algorithm examples using C language for implementation)
LongCalc
- This project is a realization calculating of long numbers. Without import libraries. This is a calculate of long number. Long number calculate. Ariphmetical of long numbers.
LinkList_test
- 数据结构单链表基本操作，用codeblocks测试通过。初始化，头插法尾插法，清空，判空，求长度，查找元素，删除元素，插入元素等。-Basic operations of single linked list data structure, with codeblocks test. Initialization, the first interpolation tail interpolation, empty, empty sentence, seeking length, find ele
StaticLinkList
- 静态链表基本操作，用codeblocks测试通过。静态链表即用游标来代替指针的数组型链表。含初始化，插入操作，删除操作。静态链表详细内容参见小甲鱼数据结构视频14-16节内容。-Static list of basic operations, using codeblocks test. Static list that is used instead of a cursor pointer array type list. Including initialization, insertion
CycleList
- c语言编写循环链表基础操作，用codeblocks调试可行，包含初始化，求长度，找节点，约瑟夫/升级版约瑟夫（带密码），拉丁方阵，魔术师发牌问题，详细见小甲鱼数据结构视频。-c language circular list-based operation, with codeblocks debugging feasible, including initialization, seeking length, looking for nodes, Joseph/upgraded version
c
- 本次试验的主要要点是哈夫曼树的建立过程，这种算法的思路是： 1）依据给定的n个权值{W0，W1，……，Wn-1}构造n棵只有一个根结点的二叉树，这些二叉树组成一个森林F={T0，T1，……，Tn-1}。 2）在森林F中选取两棵根结点的权值最小的二叉树作为左、右子树合并成一棵新的二叉树，这棵新的二叉树的根结点的权值等于其左、右子树根结点的权值之和。这样一来，森林中就减少了一棵树。 3）重复上一步，直到森林F中只有一棵二叉树为止，这棵二叉树便是要得到的哈夫曼树 二叉树建立好之后，通过
Wood-polished-to-achieve
- 木柴抛光的实现，分析源数据存储结构，使用二次排序。借此将最小的抛光时间计算出来。-Firewood polished implementation, analysis of the source data storage structure, the use of a secondary sort. Whereby the minimum polishing time calculated.
m_files_4
- Today, there is almost no area of technical endeavor that is not impacted in some way by digital image processing.We can cover only a few of these applications in the context and space of the current discussion. However, limited as it is, the m