-
permutations
组合数学全排列,包含有六种全排列的方法，字典序法(math of permutations)
- 2011-12-12 10:51:16下载
- 积分：1
-
the-dynamic-planning
本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts.
)
- 2011-12-15 16:49:05下载
- 积分：1
-
SelectSort
选择排序的实现，是一种基本的排序方法，但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)
- 2012-09-27 22:38:22下载
- 积分：1
-
数据结构算法集锦
数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)
- 2005-06-28 19:55:07下载
- 积分：1
-
joseph
用链表解决约瑟夫问题。
约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。
其中包括一个实验报告，介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
- 2012-08-27 22:37:52下载
- 积分：1
-
ecs
说明： 二叉树的演示程序。实现了二叉树和哈弗曼树(Binary tree demo program. Implements a binary tree and the tree Hafu Man)
- 2011-03-26 11:59:58下载
- 积分：1
-
length
利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度(average path lengh)
- 2011-09-01 11:13:51下载
- 积分：1
-
quicksort
数据结构快速排序例程代码，只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
- 2013-05-23 15:05:53下载
- 积分：1
-
Data-structure
说明： 分别用堆栈和数组的方法实现任何进制的数制转换(Arrays were used to stack and method of implementation of any binary number system conversion
)
- 2011-03-08 16:55:07下载
- 积分：1
-
liu
一．问题描述
对2006年度全国80多个城市的每天空气质量状况进行查询、排序等操作。
空气质量状况对象包括城市代码、城市名称、首要污染物、污染指数、污染物级别、空气状况、年、月、日
二、实验要求
1． 普通查询：输入城市名称和城市代码，分别查询该城市每天、每周、每月、每季度和全年的空气质量状况
例子：查询太原市2006年第8周的空气质量状况
2．统计查询：
（1）输入城市名称和城市代码，分别查询该城市每周、每月、每季度和全年的空气质量为优、良、轻微污染、轻度污染、重污染的天数
例子：查询石家庄市2006年第2季度空气质量为轻微污染的总天数
（2）根据时间查询空气质量状况：输入周编号、月编号、季度编号或年编号，以及空气质量为优、良、轻微污染、轻度污染、重污染的天数，查找相应的城市名称
例子：查询2006年5月，空气被轻度污染3天以上的城市有哪些？
3．排序查询
（1）输入周编号、月编号、季度编号或年编号，查询城市空气质量的排行榜
例子：查询2006年第6周，全国空气平均质量最好的前20个城市为哪些？
三、数据文件
Data.txt(one. Problem Description of the air quality day in 2006 more than 80 cities nationwide query, sorting and other operations. Air Quality objects include city code, city name, the primary pollutant, pollution index, contaminant level, air condition, year, month, day two, experimental requirements 1. General Queries: Enter a city name and city codes, each query in the city daily, weekly, monthly, quarterly example air quality and full year: Queries air quality in Taiyuan first eight weeks of 2006 2. Statistical inquiry: (1) enter a city name and city codes, each query in the city weekly, monthly, quarterly and annual air quality as excellent, good, slight pollution, light pollution, heavy pollution days example: inquiry Shijiazhuang City in 2006 second quarter, the air quality is the total number of days a slight pollution (2) according to time of the query air quality conditions: enter the week number, month number, quarter number or in number, and the air quality is excellent, good, sli)
- 2017-04-07 10:58:37下载
- 积分：1
