资源列表
b
- 01背包问题——求最大值 非常的实用算法-01 knapsack problem- seek the maximum
1
- 设有n件工作分配给n个人，将工作i分配给第j个人所需要的费用为Ci。试 设计一个算法，为每一个人都分配1件不同的工作，并使总费用达到最小。-suppose n pieces of work are arranged to n persons, it costs Ci to arrange work i to people j. design a algorithm to make it cost least and to make sure that everyone get one diffe
adjlist.c
- it is easier to work with a graph which is in adjacency list format: a list of vectors each vector contains the neighbor vertices or incident edges of a given vertex. -it is easier to work with a graph which is in adjacency list format: a list of vec
bignum
- Emerging Network To Reduce Orwellian Potency Yield
LinkList-program
- C++数据结构的一个单链表示例程序，简单易懂，适合初学者学习。-a sample program about linked list of C++ data structure , it is easy to understand for beginners.
hfmTree
- 哈夫曼树 哈夫曼树 哈夫曼树 哈夫曼树 哈夫曼树 哈夫曼树 -Huffman Huffman Huffman tree tree tree tree Huffman Huffman Huffman Huffman tree tree tree tree Huffman Huffman Huffman Huffman tree tree tree
YueSeFu
- 关于约瑟夫问题的一系类问题求解，欢迎借鉴-A series of questions about Joseph kind of problem solving, welcome to learn
Binary-Tree
- 主要利用二叉树对数据进行管理和处理，里面包含很到处理的源代码。-The main use of a binary tree for data management and processing, which contains the source code for it to handle.
Collection-of-logical-operations
- 本文档实现了字符集合的并交差等逻辑运算，采用多种语言（包括c和c++），采用多种数据结构（链表、数组等）实现集合的并交差等运算。分别用结构体和类实现。很适合初学者熟练掌握基本的数据结构知识以及集合的运算过程。-This document character set and achieve cross other logic operations, multiple languages (including c and c++), using a variety of
sorting-and-decision-algorithms
- 文档包括生成随机数组的方法、简单排序算法的实现以及闰年个数的计算方法，适合初学者掌握简单排序算法的原理，为更进一步学习数据结构打下良好的基础。-Document includes an array of methods to generate a random, simple sorting algorithm and method of calculating the number of leap years, suitable for beginners to master the prin
bubble
- 使用函数实现对数据冒泡排序的算法，传递参数为数组-Use function to achieve the data bubble sort algorithm, pass parameters to an array
test5
- 编写一段程序,使其可以满足一元稀疏多项式的表示以及加法运算功能. 其要求如下: (a) 多项式以指数递增的顺序输入。 (b) 设计的数据结构应有利于表示任意一元稀疏多项式。 (c) 输出的原始多项式及运算结果。 -Write a program so that it meets one yuan sparse polynomial representation and an adder function whose requirements are as follows: (