在v.b屏幕捕获

约瑟夫问题有原始的约瑟夫和发展了的约瑟夫两种。 原始的约瑟夫的描述： 古代某法官要判决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

MfcCDDB v1.11 A freeware MFC class to support access to CDDB servers Welcome to MfcCDDB, a collection of freeware MFC classes to support access to the Compact Disc DataBases on the Internet .

本桌面软件应用窗体，自定义菜单常用工具，数据表加密，树形控件等技术。新学者可以从中学习。人性化和个性化的界面设计，笑料十足，着实让人眼前一亮

数据库基础教程chm-database based tutorial chm

//希尔排序void ShellSort(int r[], int n){ int i; int d; int j;    for (d=n/2; d>=1; d=d/2)            //以增量为d进行直接插入排序 {     for (i=d+1; i0 &am

数据库远代码，比较好的java实现的，比较清晰好用-The database is far code, java to achieve a better, more clear and easy to use

《数据结构与算法》讲义，第3章 栈与队列。 “十一五”国家级规划教材。张铭，王腾蛟，赵海燕，《数据结构与算法》，高教社，2008. 6。-Chap3 Stack and List

SVG动态读取数据库并实时显示出来。该代码以通过后台读取时间实时显示出来，如果你需要读取数据库，请在Default.aspx中处理即可。-SVG Dynamic read the database and displayed in real time. The code to read through the background of real-time display of time, if you need to read the database, please Default.aspx in treatment can be.

Delphi SQL数据库浏览器。可以连接数据库并对表中的数据进行查询修改。

关于最佳贪婪算法的实现 关于最佳贪婪算法的实现-Greedy algorithm on the realization of the best on the best greedy algorithm