宽带提速可行性分析及建议.rar

模仿火的运动，用vertex shader 和 pixel shader编写-imitation fire campaigns, the vertex shader and pixel shader prepared

基于EVC的一个计算器程序，功能类似于PC上的计算器功能-EVC on a calculator program similar in function to the calculator function on the PC

实用易懂C++技术入门提供给C++的入门学者-practical technology portal accessible to scholars C induction

这是linux登陆时候的一小程序,主要功能实现了用户登陆时,只能执行我们定义的一些命令.其他对用户不可见.-This is the time of landing a small program, the main function of user landing, they can only enforce our definition of order. Other users can see.

这是我已经作为项目的一部分在第二学期的 MCA 的部门存储管理系统...它具有许多功能，如鼠标编程和太多的功能像添加新产品、 更新股票、 清单生成和查看许多报告......此文件来自星球源 Code.com...the 家里的数百万行的源代码

经典精品的数据窗口服务功能，里面有大量的功能，过滤，排序、动态sql,打印，隔行显，实时显示字段功能，我已升级到9.0-Classic boutique service functions of the data window, which has a large number of functions, filtering, sorting, dynamic sql, print, interlaced significant, real-time display field features, I have to upgrade to 9.0

列举出运行的进程，并能终止一些进程，系统进程终止不了，有待改进-To list running processes, and can terminate some processes, system processes can not be terminated, room for improvement in

设T[0:n-1]是n个元素的一个数组。对任一元素x，设S(x)={i|T[i]=x}。当|S(x)|>n/2时，称x为T的主元素。设计一个线性时间算法，确定T[0:n]是否有一个主元素。-Set T [0: n-1] is the n elements of an array. Of any element x, set S (x) = (i | T [i] = x). When | S (x) |> n/2 when x for T said the main element. Design a linear time algorithm to determine the T [0: n] whether there is a main element.

在资料中加上关键字索引的位置Tag(0x08:带偏移量)-Add a keyword in the data location index Tag (0x08: with offset)

迷宫的问题实质上就是图的遍历问题，我们可以用一个二维数组存储一个迷宫的各个结点，给定一个开始的坐标和一个结束的坐标．本程序可以寻找一条路径，但这条路径不是最短的．就是说不是最优的．-maze is the essence of the plan traverse the problem, we can use a two-dimensional array storage a maze of the various nodes, to set a beginning and an end coordinates of the coordinates. This procedure can find a path, but this is not the shortest path. Not to say the best.