资源列表
KITBAG
- 背包问题是用贪心算法得到最优解得一个典型问题。背包问题具有最优子结构性质首先通过快速排序算法对物品按照单价从大到小排序，然后进行贪心选择。-Knapsack problem is a greedy algorithm with the optimal solution may be a typical problem. Knapsack problem with the nature of the optimal sub-structure, first of all, quick sort a
kmp105
- 在一个长字符串中匹配一个短子串的无回溯算法。时间复杂度为O(n).-In a long string substring matching a short non-backtracking algorithm. Time complexity is O (n).
kruskal
- 克瑞斯卡尔算法，是关于克瑞斯卡尔算法的代码，详细介绍了有关克瑞斯卡尔算法的实现。-kruskal algorithm,kruskal algorithm on the code, setting out in detail the algorithm kruskal。
L5-E5
- 利用函数和递归做一个数列的加减运算，数列的加减运算有一定的规律，可利用函数与计算出结果-The constant can be calculated by the infinite series: = 4- 4/3+ 4/5- 4/7+ 4/9- 4/11+.... Write a C program that uses a do/while loop to calculate using the series. The program
NT_Driver
- 基于WDK驱动环境，开发了NT式的驱动，它是不支持即插即用功能的。-It is NI driver which is used in WDK.
WDM_Driver
- 基于WDK环境，开发了WDM式驱动。它是支持即插即用功能的WDM式的驱动程序。-It is WDM Driver which is used in WDK.
TestDriver
- 基于WDK环境，开发了分层驱动程序。分层驱动可以将功能复杂的驱动程序分解为多个功能间的驱动程序。-It can finish IRP request.
WDM_PCI_Driver
- 基于WDK开发了PCI驱动。根据读取ＰＣＩ配置空间，可以得到ＰＣＩ设备的所有资源。-The project is used for PCI driver.
most
- 计算一个数列的众数，即出现次数最多的那个数，要求尽量低的时空复杂度-calculate a series of the plural, that is the highest number that the number of requests time and space as low complexity
mouse_click
- 鼠标自动点击程序,支持单击和双击时间设定.-Mouse auto click program, click and double-click time setting support.
MS_FILES_12
- 这是C++Primer的书籍的源代码，包括课后习题的答案，是份很不错的代码，尤其针对初学者-This is the source code of C++Primer books, including after-school exercises, answers, were very good code, especially for beginners
MUSCI4
- 用C++写的音乐播放小程序之4！用于学习掌握VC++！-With C++ Writing music player applet 4! For learning and mastering the VC++!