编的不好请各位多指教一个小的智力游戏

该压缩包收集了美信MAXIM的2千3百多个器件的封装，采用protel99SE格式制作。-The compressed packets collected Maxim MAXIM 2 1000 3 packages more than 100 devices, using Protel99SE format.

BOSS窗口开发 C 语言程序库-BOSS development window for C Programming Language

对于汉诺塔，大家一点不陌生，这是我数据结构的一个作业，里面讲的很详细-The Tower of Hanoi, is no stranger to everyone, this is my data structure of a work, which stresses the very detailed

ＴＭＳＦ2812DSP281x_Mcbsp多通道缓存头文件-TMSF2812 DSP281x_Mcbsp multi-channel buffer header files

visual basic程序实现行星轮设计-visual basic program design of planetary gear

一类非线性规划问题在LINGO下的求解！-a nonlinear programming problem LINGO in the solution!

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins

带LCD驱动纳瓦级mpu pic16F946 ad采样程序-with LCD driver Navarro-mpu pic16F946 ad sampling procedures

一个FLASH游戏 ,不是很大 ,是超级码梨的翻版,操作和8位机的游戏一样. -a game, not big, super yards pear is a reprint of operation and eight of the game machine.

PL2303-18HXusb线的驱动，用于手机，平台的调试，-PL2303-18HXusb line driver for mobile phones, platform debugging,