几种常用排序算法的效率比较,通过测试可得出这几种排序算法的优劣....

数据结构课本的算法，自己独立编写，配套教材严蔚敏，清华大学出版社。声明：未经本人许可，禁止用于商业和不法用途。本作者对本代码保留所有权利。-Data structures textbook algorithms, their own independent writing, supplementary materials, Yan Wei-Min, Tsinghua University Press. Statement: without my permission is prohibited for commercial and illicit purposes. The author of this code All Rights Reserved.

一道北大acm的试题，用双向链表实现模拟内存分配的程序-1 Peking University acm of examination questions, with two-way linked list of memory allocation procedures for analog

双数组建树代码，简单扩张就可以使用的，欢迎大家下载使用-achieved double-array code, the simple expansion could use, we welcome downloading

acad 公差查询源码, a2004,05,06, 可选择文本-Academy of tolerance inquiries source, a2004, the"06 option to text

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.

在 C + + 包括节点和整个数据结构和 haffcode 执行完整的哈夫曼树

从键盘上输 入一串正整数， 最后输入－1作为输入结束的标志。以这些正整数的值作为二叉排序树中的结点的数据场之值，建立一棵二叉排序树要实现排序二叉树的插入。采取叶子插入法，即新插入的节点均为改二叉树的叶子节点，且满足中序有序性。-From the keyboard to enter a string of positive integers, the last input-1 as the input end of the sign. These are integer values as binary sort tree nodes in the data field" s value, and the establishment of a binary sort tree to achieve binary tree insertion sort. To leaf insertion method, that the new nodes are inserted to change the binary tree leaf node, and in order to meet the orderliness.

魔王语法解释 数据结构的实验和实验报告，包含实验报告，源码等-Devil syntax explained the experimental data and experimental structure of the report, including test reports, source code, etc.

用delphi实现的各种排序算法，图形界面，可实现插入排序、交换排序、选择排序、合并排序以及基数排序-used to achieve the various sequencing algorithms, graphical interface, insert can be realized, in order of ranking exchange, SELECTION SORT, the merger sort of base sequencing

关于最佳贪婪算法的实现 关于最佳贪婪算法的实现-Greedy algorithm on the realization of the best on the best greedy algorithm