oracle database for the ranking algorithm

本人原创（delphi程序设计提高与应用）源码。本实例利用ADO组件与Access数据库连接，并可将其中的数据表中的数据生成word报表及Excel文件。源码中几乎所有的步骤都有详尽的说明，是delphi初级数据库编程人员快速进入状态的实用案例。-My original (delphi improve program design and application) source. The examples of the use of ADO components with the Access database connection, the data could be data in the table below to generate word statements and Excel documents. Source of almost all the steps are very detailed, is the primary database delphi programmers to quickly enter the state of practical cases.

描述 问题描述： 给定一个只包含数字[0..9]的字符串，求使用字符串中的某些字符，构建一个能够整除15的最大的整数。 注意，字符串中的每个字符只能使用一次。 编程任务： 求由给定字符串构建的能够整除15的最大整数。-Description of the problem description: Given a contain only numbers [0 .. 9] of the string, seeking to use some of the characters in the string, one can build the largest integer divisible by 15. Note that the string for each character can only be used once. Programming task: seeking from the given string that can build the largest integer divisible by 15.

这是一个网络数据库回调例程,基于SocketConnection的-This is a network database callback routines, based on the SocketConnection

二叉树遍历的递归算法,帮助理解程序设计过程中的递归思想,以及二叉树遍历的基本思想-Recursive binary tree traversal algorithm, to help understand the program design in the process of recursive thinking, as well as the basic idea of binary tree traversal

用VB+access数据库设计的学生公寓管理信息系统.有一定实用参考价值!-VB access database design student apartment management information systems. Have practical value!

wordpress中文版的部落格系统，可以自由改变，无可金钱衡量-the Chinese version of wordpress blog system that can freely change, no money as a gauge

编译成功，odbc型数据库编程-build successful, odbc Database Programming

数据结构底层经典算法――时间陷阱，请大家参考-underlying data structure classical algorithm-- time trap, please refer to

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

可以建立函数输入二叉树，并输出其赫夫曼树。在上交资料中请写明：存储结构、 基本算法（可以使用程序流程图） 、输入输出、源程序、测试数据和结果、算法的时间复杂度、另外可以提出算法的改进方法；-The establishment of Huffman tree