登录
首页 » Visual C++ » shellpaixu

shellpaixu

于 2013-07-18 发布 文件大小:1KB
0 252
下载积分: 1 下载次数: 1

代码说明:

  希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • codes
    数据结构相关代码,源码-数据结构算法解析(高一凡 )(Data structure-related code, source code- Data Structure Analysis algorithm (high one where))
    2008-05-23 02:41:54下载
    积分:1
  • SeqQueue
    数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
    2013-06-15 16:27:32下载
    积分:1
  • Dijkstra
    迪杰斯特拉算法,数据结构,C语言写的,上大学计算机系会用到的。。。(Dijkstra algorithm, data structures, C language written on the Department of Computer Science will be used. . .)
    2013-03-06 21:50:34下载
    积分: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
  • CatchData
    说明:  读取股票数据文件,C++源程序,非常好用。是学生做毕业设计的源料(Read the Stock Data File)
    2010-03-22 20:19:35下载
    积分:1
  • xiaobaishu
    参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写,很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
    2013-08-29 16:09:43下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • Huffman-Tree
    使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率,并据此构造Huffman树,编制Huffman 码;根据已经得到的编码,对01形式的编码段进行译码。 具体的要求: 1.将给定字符文件编码,生成编码,输出每个字符出现的次数和编码; 2.将给定编码文件译码,生成字符,输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)
    2015-05-22 15:37:03下载
    积分:1
  • ABC-VC
    蜂群算法C语言实现,附带中文注释,简单易懂(ABC algorithm coded using C programming language)
    2020-09-16 02:17:56下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载