资源列表
QS_3star
- 程序利用循环的方式实现了快速排序算法，改变了递归算法无法实现大规模数据处理的缺陷，另外三准星法也提升了算法的效率和稳健性。-Procedures be achieved using the rapid cycle of sorting algorithms, recursive algorithms can not change the large-scale data processing defects in the other three sight law also improves t
vector
- 该算法用不同的方式实现了向量加法，通过给出不同方式的执行时间证明了不同算法的效率高低不同。-The algorithm is implemented in different ways, vector addition, through the different forms of execution time is given to prove the efficiency of different algorithms with high and low.
testpra
- 程序用不同的查找方式实现了在一个数组中找出所有等于某一个数据元素的方法-Program to find different ways to achieve in an array to find all the other data elements to a particular method of
321
- 实现对图书的查找，删除，添加，以及合计。读者的借阅，归还，馆员管理-Realize the book to find, delete, add, and the total. Readers borrow, return, librarians Management
yudonghui
- 编写一个统计程序实现运动会分数统计 1. 输入的形式和输入值的范围:在本演示程序中，输入有两种形式，整数和字符。-The preparation of a statistical program to achieve a sports scores statistics. Input form and input range of values: In this demo program, enter the two forms, integer and character.
bahuanghou
- 八皇后C实现 数据结构 八皇后的才语言实现-8 Queen' s C data structure, 8 Queen' s only language implementation
Huffman
- Huffman编码的c实现 数据结构 算法设计-Huffman-encoded data structure, algorithm design c
Binarysearchtreedeshixian
- 1．掌握二叉搜索树的基本概念。 2．掌握二叉搜索树基本操作的实现。 -1. Binary search tree to master the basic concepts. 2. To master the basic operation of binary search tree implementation.
JosephRing
- 1、学会通过对问题的分析，设计一种合理的数据结构，并进行定义及操作的实现。 2、掌握利用线性表的各种操作来进行具体的实际应用。 3、加强程序设计的能力。 -1, learning through the analysis of the problem, design a rational data structures, and the realization of the definition and operation. 2, master the use of the line
chengji
- 基于c编写的学生成绩管理系统 dos界面-C-based management system for the preparation of student achievement dos Interface
segment_tree
- 线段树的基本数据结构，线段树扩展，线段树应用。-The basic segment tree data structure, segment tree expansion, segment tree application.
spanning_tree
- 最小生成树的多种形式。Kruskal邻接表，正向表，prim+binary_heap邻接表正向表，prim+mapped_heap邻接表正向表.-Minimum spanning tree in many forms. Kruskal adjacency list, forward the table, prim+ binary_heap forward adjacency list table, prim+ mapped_heap forward adjacency list table.