This a small program which scans a particular section of your hard disk ( a tree...

介绍C++模板库的很好的教程,极具参考价值,能使你得到较大提高-Introduced the C++ Template library very good tutorial, great reference value, can you get a larger raise

关于VC++和Matlab混合编程的一本PDF格式的书籍。-On the VC++ and Matlab programming mixed a PDF format of the book.

Andrew Koenin成名之作.. 本书所揭示的知识，至少能够帮助你减少C代码和初级C++代码中90％的Bug 聆听大师教诲 掌握编程精髓... -Andrew Koenin famous for .. The book of revealed knowledge, at least be able to help you reduce the C code and primary C++ Code 90 of the Bug programming to listen to master the essence of the teachings of master ...

众兴最新开发代码，原理阐述清晰，每一步都有图说明。本人就是看了这个文档才真正搞明白的，以前因为没有图片一直不清楚中间过程效果-Adtech latest development code, the principle expounded clearly illustrates every step. I just read this document truly understood, previously been unclear because there is no picture effect intermediate process

一个实现背包问题的程序，挺有意思的，快来下载哦，准你满意！-a knapsack problem achieving the procedure quite interesting, Come download Oh, you associate satisfaction!

自己的小程序!请看一下!自己写的小程序-own small program! See what! His writing small programs

给定N中物品和一个背包。物品i的重量是Wi,其价值位Vi ，背包的容量为C。问应该如何选择装入背包的物品，使得转入背包的物品的总价值为最大。 在选择物品的时候，对每种物品i只有两种选择，即装入背包或不装入背包。不能讲物品i装入多次，也不能只装入物品的一部分。因此，该问题被称为0-1背包问题。该算法中,矩阵c的大小为(m+1)×(n+1),物体的重量、价值和解向量大小都等于物体个数n,故该算法的空间复杂度为O(nm)。对物体重量、价值的初始化(算法实现略)所需时间都为n,解向量和矩阵第0行初始化时间为n,矩阵第0列初始化时间为m,对矩阵c的计算所需时间为n×m,解向量X的确定时间为n,故整个算法的时间复杂度为O(nm)。

C++ Templates 完全导引 对于理解和编写C++程序有很大好处-C++ Templates complete guide to understand and prepare for the C++ Procedures can bring considerable benefits to

一个用vc写的日历控件.-vc write with a calendar control.

wince 5.0 MFC EVC 4.0 应用程序-wince 5.0 MFC EVC 4.0 application