一个简单的数据库管理系统,是用delphi开发的.

计算10000以内的阶乘,计算阶乘的程序-calculation 10,000 within the factorial calculated factorial procedure

1、 用随机数生成的方式（要求用户输入随机数）产生一个迷宫：“1”表示墙，“0”表示路，最后的路径用“8”表示，若没有路径则打印报文，若有路径则打印出路径。 2、 通过堆栈及判断实现迷宫的自动寻找路径功能 -1, the random number generator of (requiring user input random number) produces a maze : "a" Wall said, "0" Lu said, the final path with "8" that if no path was reportedly Print text, if it were printed out trails path. 2, stack and judgment to achieve the labyrinth path function to automatically search

应用背景此源代码将保存到用户表前检查该用户名可用性。这很重要，这样用户可以触发，如果数据已经存在。这是使用Ajax，所以它不会刷新页面，显示响应如果存在或不。希望它能帮助。谢谢你。关键技术技术和组件的选择：1 PHP2。MySQLjQuery的Ajax 3 /HTML 45 CSS6 Ajax7。自举

随着旅游业的发展，酒店、餐饮娱乐行业日趋发达，引入全方位的电脑服务和电脑管理日益流行。同时，酒店和餐厅娱乐业引入电脑服务和管理也取得了优良的经济效益和社会效益。为此，国家建设部已于最近作出明确规定：凡星级酒店在项目审批时，其设计方案必须包括电脑管理系统，否则不予立项。可见，酒店管理电脑化势在必行。酒店管理系统将先进的电脑技术与现代酒店服务管理完美地结合起来，实现了住宿、餐饮、娱乐全新概念的服务和管理方式。-With the development of tourism, hotel, restaurant, and entertainment industries increasingly developed, the introduction of comprehensive computer services and computer management is increasingly popular. Meanwhile, hotels and restaurants to introduce computer entertainment services and management has made good economic and social benefits. Therefore, the Ministry of Construction has recently made clear : all-star hotels in the project"s approval, its design must include computer management system, otherwise, not creation. Visibility, hotel management computerized inevitable. Hotel management system of advanced computer technology with modern hotel management services to the perfect combination to achieve accommodation, catering, entertainment brand new concept of service and man

线性表元素删除运算,删除线性表L中第i个位置上的元素-linear elements to delete Table Operational delete Table L linear section i positions on the elements

数据库查询示例程序 　数据库查询示例程序 　-Procedures database query database query examples of sample programs

有关数据结构的源代码。。。望大家指教。。。同时也想下载信息论的-The data structure of the source code. . . Hope everyone advice. . . At the same time also want to download the Information Theory

数据结构课程设计，校园咨询，为来访客人提供方便查找景点，最短路等信息-data structure course design, campus counseling, visitors find convenient spots, the most short-circuit, and other information

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.