搜索资源列表
1434
- 作者：不详 来源：不详 加入时间：2003-1-28 阅读次数： 阅读选项:文字 黑色红色白色灰色绿色蓝色青色黄色背景 白色粉红灰色绿色蓝色黑色青色棕色字号 9 pt10 pt12 pt14 pt16 pt18 pt24 pt30 pt字型 正常加粗 自动滚屏[左键停止]-Author : not available Source : unknown date of entry :2003-1-28 reading number : reading options : black char
howmany
- 口袋中有红，黄，蓝，白，黑5种颜色的球若干个。每次从口袋中取出3个不同颜色的球。问有多少种取法的C＋＋代码-pockets of red, yellow, blue, white and black colors of the five Ball number. Out of pocket every three different colors on the ball. Asked how many copying the C + + code
CRBTree
- Red Black Tree ,an important part of IT.
removeRBTee
- 在VC++6.0编译器环境下完成红黑树的删除，基于C++源码的编程 直接新建满足条件的红黑树，然后删除选定的结点-In VC++6.0 compiler environment to complete the removal of red-black tree, based on C++ source code directly to the new programming to meet the conditions of the red-black tree, and then delete
ds-2011-04-06
- 自己写的双向循环链表库，动态数组，红黑树，-Two-way circular linked list to write their own libraries, dynamic arrays, red-black tree, etc.
sanseqiu
- 该程序解决了三色球问题，一个袋子中有12个球，其中有3个红的，3个白的和6个黑的，问从中任取8个有多少种不同的颜色搭配。-The program to solve the three-color ball, a bag 12 goals, including three red, three white and six black and asked to either take from eight different colors with.
Bmp_CMYK
- BMP位图的分色技术，将BMP格式位图的红色、绿色、蓝色，分解成印刷行业所用的青色、黄色、品红、黑色-BMP bitmap color separation technology, BMP format bitmaps red, green, blue, broken down into the printing industry with the cyan, yellow, magenta, black
red-black-tree
- this one make red black tr-this one make red black tree
homework1
- 1.构建VI，产生两个随机数（0到1之间）并在仪表上显示两个随机数。仪表上分别设置标签“随机数1”和“随机数2”，使其中一个仪表显蓝色而另一个显红色。当红色仪表上随机数值比蓝色仪表随机数值大时，用一个圆形LED显示绿色，否则LED显示黑色。运行并观察结果。-Construction VI, to generate the two random numbers (between 0 and 1) and two random numbers are displayed on the instrum
11
- 构建VI，产生两个随机数（0到1之间）并在仪表上显示两个随机数。仪表上分别设置标签“随机数1”和“随机数2”，使其中一个仪表显蓝色而另一个显红色。当红色仪表上随机数值比蓝色仪表随机数值大时，用一个圆形LED显示绿色，否则LED显示黑色。运行并观察结果。-Construction of VI, to generate two random numbers (0 to 1) and in the instrument display two random numbers.The instrument
drawpoint
- 按“↑、↓、←、→”可在屏幕上向四个方向画点，按“L、B、W、C、P、Y、R、G”分别将点的颜色变为“蓝、黑、白、青、紫、黄、红、绿”，按“ESC”可退出程序-Press " ↑, ↓, ←, →" to the four directions on the screen to draw point, press " L, B, W, C, P, Y, R, G" , respectively, the color of the dot becomes &quo
lockfree-lib
- lock-free红黑树操作的C语言库 可以在并行环境下保持较高的吞吐量-lock-free red-black tree operation of the C language library
qiu
- 用C语言编程：若一个口袋中放有12个球，其中有3个红的、3个白的和6个黑的，问从中任取8个共有多少种不同额颜色搭配？-Using the C programming language: If a pocket placed 12 balls, including three red, three white and six black, asked to take any from the total number of eight different colors forehead?
SectionTree
- 区间树上的查找算法，要求先输入若干区间用来构造红黑树，之后再向树中输入一个查找区间，输出上述区间在树中的重叠区间。需要在红黑树插入操作的基础上进行完成。-Interval tree search algorithm, asked to enter the number of intervals used to construct the red-black tree after tree again enter a search range, the output of the interval
xuerendonghua
- HTML5实现圣诞雪人动画代码基于HTML5、CSS3、prefixfree.min.js制作，雪人跳跃动画效果，红色网页背景，雪人戴着黑色帽子，蓝色围巾。-Christmas snowman realize HTML5 animation code based on HTML5, CSS3, prefixfree.min.js making, snowman jumping animation, red page background, snowman wearing a black hat,
c
- 编写一个程序，从3个红球，5个白球，6个黑球中任意取出8个球，且其中必须有黑球，输出所有可能的方案。-Write a program, the three red balls, five white balls, arbitrary took out eight goals in six black ball, and there must have a black ball, the output of all possible solutions.
c
- 区间树，创建区间树，插入删除和搜索操作。 红黑树创建查询删除。 二分查找，多种排序方式实现，快速矩阵运算实现-Interval trees, create a range of trees, insert and delete search operation. Create a query remove red-black tree. Binary search, sorting various ways, matrix operations to achieve fast
RBTree
- 算法导论中红黑树插入删除源码,自己编写的 亲测可用-Introduction to algorithms in the red and black tree insert to delete the source code