各种常用的排序算法的演示程序， 以顺序表作为存储结构～～～～ 欢迎大家指正...

此为Delphi树控件的一个数据库运用-this tree controls for the use of a database

这是李春葆的《数据结构全书》的源码，亲测运行通过，比较适合自学数据结构，好东西当然不能独吞了，好评呦，亲！适合考研的同同学

该程序能够实现傅立叶的快速转换和放转换用vb语言来实现，整体效果不错！-the procedures to achieve fast Fourier transformation and the conversion put vb language used to achieve the overall effect was excellent!

在0和1情况下进行背包问题解决，涉及多个物体的重量和价值，求得最大价值量以及分配方案。-At 0 and 1 backpack case for problem-solving, involving more than the weight of objects and values, as well as to achieve maximum value distribution program.

NetBeans下的 Java访问数据库的工程文件。-NetBeans under the Java access to the database project file.

匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.

数据结构的查询方式及其应用，是其中的比较重要的一种-Query data structure and its applications, is one of the more important a

C语言实现数据结构中最短路径的算法代码，有图形显示。欢迎下载-C language data structure, the shortest path algorithm code, a graphical display. Welcome to download

用c语言设计实现一个用事件驱动的“救护车调度”离散模型，模拟120急救中心响应每个病人的呼救信号统一调度救护车运行的情况。 我们对问题作适当简化，假设：某城市共有m个可能的呼救点(居民小区、工厂、学校、公司、机关、单位等)，分布着n所医院(包含在m个点中)，有k辆救护车分派在各医院待命，出现呼救病人时，由急救中心统一指派救护车接送至最近的医院救治。救护车完成一次接送任务后即消毒，并回原处继续待命。假定呼救者与急救中心、急救中心与救护车之间的通讯畅通无阻，也不考虑道路交通堵塞的影响。可以用m个顶点的无向网来表示该城市的各地点和道路。时间可以分钟为单位，路段长可表示为救护车行驶化费的分钟数。 这里设m=10,n=3,k=2。并且令消毒时间为２分钟-language used to achieve a design using event-driven "ambulance dispatch" dispersion model to simulate 120 emergency response center each patient"s distress signal unified dispatching ambulances running. We issue the appropriate simplified assumptions : m in a certain city a total of 000 points possible hue (residential quarters, factories, schools, companies, organizations, units, etc.), distributed by the hospital n (m included in the points), k ambulances were deployed in the various hospitals on standby there cries of the patients, from the first-aid center unified ambulance escort assigned to the nearest hospital for treatment. Ambulance completed

7中内排序的c语言代码,包括:直接插入,shell,选择,冒泡,等等排序算法-7 within the sort of c language code, including: direct insertion, shell, selection, bubble, and so sorting algorithm