dds

face detector to detect face area in the given image

小型中英文打字练习器-small and typing practice for the English

串口调试程序大家可以用来调试自己的串口哈 -serial debugging process can be used to debug all their serial Kazakhstan

使用一排列对象接受类型int、浮点和串的实体类型3 attibutes 展示对constructor的用途。-A program that uses an array of objects that receives 3 attibutes of an entity type of type int, float and string demonstrates use of constructors.

Orcle patch file fix zip-Oracle patch fix zip file

实现连连看游戏 和平时看到的连连看没什么分别，初学c++可以参考代码-Lianliankan game to achieve peace Lianliankan see no difference between the beginner c++ can refer to the code

常见的排序算法，如插入排序，快速排序-common algorithm, such as the insertion sort, rapid sequencing etc.

MIX的模拟器： MIX是《计算机程序设计艺术》(TAOCP)的作者高德纳(Donald.E.Knuth)在TAOCP中描述算法时使用的一种假想的机器，所以书中的汇编代码无法在任何一个机器上运行，附件中的程序可以让以MIXAL汇编语言写成的算法在Windows平台上汇编并且可以单步跟踪运行。详细情况参看其中的MIXBuilder.doc文件。 -MIX simulator : MIX "Art of Computer Programming" (TAOCP), the author of Donald Knuth (Donald.E.Knuth) TAOCP algorithm describes the use of an imaginary machine, a compilation of the book in any code not run on a machine, the Annex procedures to allow MIXAL compilation algorithm written in the language in the Windows platform compilation and can single-step tracking operation. See details of the MIXBuilder.doc document.

一个有趣的拼图游戏-an interesting pieces of the jigsaw

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then