资源列表
398_timer_calculator_v2.7.0.0
- avr_timer calculator-avr_timer calculator.....
MergeSort
- This is source code of Merge sort algorithms. By using the OOP code source.
Test-Quicksort
- This the Quick sort source code. By using the OOP source code. Hope you like it!-This is the Quick sort source code. By using the OOP source code. Hope you like it!
SSort
- This selection sort source code. -This is selection sort source code.
Cau-truc-du-lieu-code
- source code CTDL by using OOP
singleton
- 这是一个简单的单例模式的示范，适合刚学设计模式的初学者去了解一下-That this is a simple demonstration of the singleton pattern, suitable for beginners just learning design patterns to find out.
Stack
- 1.使用栈完成一个字符串的逆序输出 2.使用该栈完成表达式的括号是否匹配? 3.对数学表达式求值-1 Using the stack in reverse order to complete a string of output 2. Use the stack to complete the expression in parentheses match? 3. Evaluates mathematical expressions
1
- 数据结构，线性表的基本操作及调试，长度20个字-Data structures, basic operations and commissioning of the linear form, the length of 20 characters
Binary-Tree
- 生成二叉树，前序、中序、后序遍历二叉树。可以使用菜单选择。-Generate binary tree, preorder, inorder, postorder tree traversal. You can use the Select menu.
main
- 动态建立一个哈夫曼树，文件都在一个main文件夹里-Dynamic build a Huffman tree, file in a main folder
stack
- 输入一个从小到大的顺序链表,执行相关操作,然后输出该链表的倒序序列.-The order list to enter a large, implementation of the relevant operation, reverse sequence and then output the list.
Knapsack-problem
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。-Knapsack problem