屏幕录像模块VC代码

INFORMIX数据库优化SHELL，可以一目了然地发现数据库中的性能问题。-shell form informix ,can find question of databases

ACM解题报告，必有有用，特别对于初学者，看是否对你有帮助-ACM problem-solving report, there must be useful, especially for beginners to see if there is help for you

用C生成一个课程二叉树,同时先、中、后序遍历该二叉树-C programs generated a binary tree, first, during and after the preorder the binary tree

练习时做的一个老乡通信录管理系统,可从WORD中导入数据,存入ACCESS数据库中-Practicing to do a hometown address book management system can be obtained from WORD to import the data into ACCESS database

数据结构课本的算法，自己独立编写，配套教材严蔚敏，清华大学出版社。声明：未经本人许可，禁止用于商业和不法用途。本作者对本代码保留所有权利。-Data structures textbook algorithms, their own independent writing, supplementary materials, Yan Wei-Min, Tsinghua University Press. Statement: without my permission is prohibited for commercial and illicit purposes. The author of this code All Rights Reserved.

广义表的头文件简单实用，一般般的操作都有说明。-Generalized table header file is simple and practical, generally have been described as the operation.

一元稀疏多项式计算器[加法和乘法] 问题描述： 设计一元系数多项式计数器实现两个多项式间的加法、减法。 基本要求： （1） 输入并建立多项式 （2） 输出多项式，输出形式为整数序列：n，c1，e1，c2，e2……cn，en，其中n是多项式的项数，ci，ei分别为第i项的系数和指数。序列按指数降序排列。 （3） 多项式a和b相加，建立多项式a+b，输出相加的多项式。 （4） 多项式a和b相减，建立多项式a-b，输出相减的多项式。 用带表头结点的单链表存储多项式。 测试数据： (1) (2x+5x8-3.1x11)+(7-5x8+11x9) (2) (6x-3-x+4.4x2-1.2x9)-(-6x-3+5.4x2+7.8x15) (3) (x+x2+x3)+0 (4) (x+x3)-(-x-x-3)-one yuan sparse polynomial calculator [Addition and multiplication] Problem description : Design one yuan polynomial coefficient counter achieve the two polynomials addition, subtraction. Basic requirements : (a) input and the establishment of polynomial (2) output polynomial, the output form of integer sequence : n, c1, e1, c2, e2 ... cn, en, where n is the polynomial Number, ci, ei for the first item i the coefficients and indexes. By sequencing index in descending order. (3) a and b polynomial addition, the establishment of a polynomial b, the combined output polynomial. (4) a and b polynomial subtraction, the establishment of a polyno

本书是作者编程经验的结晶，由发表在杂志上的专栏文章构成，每一章内容相对独立，但都是编程过程中的有机组成部分。本书内容包括问题定义、算法、数据结构、程序验证与测试、程序优化与效率问题，以及这些技巧在排序、查找和字符串处理等方面的几个实际应用。本书每章末尾都附带有相关内容的问题，附录中给出了一些问题的提示和解答。仔细思考问题或与同事进行讨论，可以巩固所学知识，将作者的经验应用到自己的编程实践中。-This book is the author of the crystallization of programming experience, published in the journal by the column consists of the contents of each chapter is relatively independent, but they are in the process of programming an integral part. The book includes problem definition, algorithms, data structures, program verification and testing, process optimization and efficiency issues, as well as these skills in sorting, string search and deal with several aspects of practical application. The book comes at the end of each chapter has relevant content issues, the appendix gives some tips and answers to the problem. Think carefully about questions or discussion with colleagues, you can consolidate the knowledge acquired will be applied to the author

数据结构最小生成树的求法――算法 数据结构可后实习题目-minimum spanning tree data structure for the law-- algorithm data structure can be subject after practice

数据库编程，连接VC 希望对你有帮助 快下喽-Database Programming, connecting VC would like to help you soon myself