最段路径算法C++实现 实现工程清晰可见 仅供参考

Access数据库下实现的系统，功能很强大，适合初学者学习~-Implemented under the Access database system, function is very powerful, suitable for beginners to learn ~

二叉树的基本操作-binary tree as the basic operation

设有n个人站成一圈，每个人持有一个密码（正整数)。现从第t个人开始，按顺时针方向“1,2,3,4,…”循环报数，数到m1（第t个人所持密码）的人出列，然后从出列者的下一个人重新开始报数，数到m2（刚出列者所持密码）的人又出列，如此重复进行，直到n个人都出列为止。-something like Joseph problem

一套采用php+mysql数据库方式运行的多用户网上商城系统，具有安全、负载量高，访问迅捷的特点，能与论坛、博客、CMS等系统整合并支持一站登陆。系统内置贝宝、支付宝、快钱等在线支付网关以及QQ、旺旺、雅虎通即时网络通讯工具.-Adopted a set of php+ Mysql database running multi-user online mall system with safe, high-load, quick visit to the features with forums, blog, CMS, such as systems integration and support the one-stop landing. PayPal embedded system, AliPay, quick money, such as online payment gateways, as well as QQ, Wangwang, Instant Messenger network communication tools.

本代码是约瑟夫环的循环链表实现方法,可以帮助理解约瑟夫环的基本原理,及其实现-This code is Joseph Central List realize the cycle method, can help to understand the basic principles of Joseph Ring, and its realization

以高效率的方法查找一个数组中的第二大数，数组中的数可以相同.同时对各种可能发生的错误返回相应得错误代码。-find second max number in a high effective method.The number in the array could be the same.meanwhile ,the program return special error code

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

示例：为MSHFlexGrid控件的表格设置不同的背景色！-Example: In order to form a different background color to set!

本书主要介绍Delphi的数据库编程知识，为Delphi开发人员提供了很好的指导。-This book introduces the Delphi programming knowledge database for Delphi developers have provided a good guide.

万年历的算法 c语言-hefty almanac algorithm c language.