Kruskal算法寻找最小生成树,C语言实现，有完整的注释！

MD5算法的java实现，完整的代码，供大家学习只用-java MD5 algorithm to achieve complete code for all to study only

一个完整基于C#企业电话客服系统设计，文件包括具体的使用步骤和代码解释。功能设计：  C#中调用API函数，使用C#开发语音卡，C#开发Access数据库，窗体的显示模式，窗体的显示模式，各种控件的数据绑定。

魔王语言翻译，严蔚敏数据结构实习报告中需要用到的代码-Devil language translation, YAN Wei-Min internship report data structure of the code needed

连接oracle的java库- Connects oracle the java storehouse

实现m阶B_树 （2）将线性表中的键值插入到B_树中（即建立索引）； （3）当删除和插入数据到线性表时，同时维护其索引B_树。 （4）可根据所给键值范围，输出该范围的所有键值-achieve m bands Containing tree (2) linear scale for the keys inserted into Containing tree (index); (3) When the deletion and insertion of data to the linear scale, while preserving its index Containing tree. (4) According to the pair, the scope of the output of all keys

数据结构与算法分析中创建链表，实现多项式相加-Analysis of the data structure and algorithm to create a list, add up to the realization of polynomial

本书是关于计算机科学与工程领域的基础性研究科目之一――数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。-the book is on the computer science and engineering fields, the basis for one of the subjects of study-- data structure and algorithm monographs. The book in a brief review of the basic design concept C program on the basis of a comprehensive and systematic introduction of the queue, stack, trees and map basic data structure and the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm multiple algorithm design methods, data structures and algorithms for continuous learning Research and lay a solid foundation. Even more valuable is that the book not only on the theoretical knowledge but also provided more than 50 application examples and more than 600 Exercises Road. The contents broad authority, a clear and reasona

SQL Server 2000编程员指南-SQL Server 2000 Programming Guide

//希尔排序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

Delphi2005数据库开发教程.rar-Delphi2005shujukukaifa