经典VC排序源代码，做成了win32界面形式,希望对大家用所帮助

教育考试管理系统，可用于学习数据库的编写-Test management system, the database can be used to study the preparation of

约瑟夫问题有原始的约瑟夫和发展了的约瑟夫两种。 原始的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，他有一条荒唐的法律，将犯人站成一个圆圈，从第S个人开始数起，每数到第D个犯人，就拉出来处决，然后再数D个，数到的人再处决―――直到剩下的最后一个可赦免。 发展的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，但这N个人每人持有一个密码，他有一条荒唐的法律，将犯人站成一个圆圈，法官先给出一个密码M，从第S个人开始数起，每数到第M个犯人，就拉出来处决，再根据这个人所持有的密码F，然后再数F个，数到的人再处决，以此类推―――直到剩下的最后一个可赦免。-Joseph problems have original development of the Joseph and Joseph two. The original Joseph Description : Ancient a judge to sentence N inmates of the death penalty, he is a ridiculous law, prisoners station into a circle, from S began a few individuals, every few months to D prisoners, pull out executions, then D, the number of people to be re-executed--- until the last one left to be pardoned. The development of the Joseph Description : Ancient a judge to sentence N inmates of the death penalty, but each individual N holders a password, he is a ridiculous law, prisoners station into a circle, the judges first gave a password M, S individuals from the beginning of several, each of the first few inmates M , pull hi

-

class pour activation des formes géométriques triangulaires et rectangulaires

下面是本人做的一个关于菜单的程序,其中对菜单的各种改变采用了重画技术.. -Below is the one I do on the menu of procedures, which on the menu to change the re-drawing of the technology ..

校园导游图算法--数据结构中有关图的算法 按v求最短路径 按s求信息； 按q退出； 地图在map图像文件里-campus tour map algorithm-- data structure of the plan according to the algorithm for the shortest path v s by seeking information; Q withdrawal by; Maps map image file

以邻接矩阵作为图的存储结构，根据键盘输入创建图，并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan

Ｃ语言做的一个数据库的小程序，虽然小，但是可以帮助初学者学习怎样用Ｃ实现数据库编程-C language to a database of small programs, although small, but can help beginners learn how to use C Database Programming

此函数功能是图的遍历算法，用邻接矩阵存储图，然后求出其拓扑排序，再输出其图的信息-Function is to map the function of the traversal algorithm, the adjacency matrix storage map, then calculated the topological sort, then the output of its map information

一些二叉树的功能，包括二叉树的创建，遍历，以及二叉树的深度和叶子数量的统计