Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - hill
Search - hill - List
DL : 0
这是一个关于数据结构中三种排序的程序,包括拓扑排序,快速排序,希尔排序。都是经过老师检查过的。-This is a data structure on the three sequencing procedures, including topological sorting, quick sort, Hill sequencing. After all the teachers checked.
Update : 2024-05-14 Size : 164864 Publisher : 袁伟

插入排序的直接改进算法--希尔排序算法.将用户输入的一列数按递增顺序排好并输出.以及直接插入冒泡选择排序算法的实现-inserted directly improve the ranking algorithm-- Hill sorting algorithms. Users input a few in increasing order to arrange and output. Bubble and direct insertion Selection Sorting Algorithm Implementation
Update : 2024-05-14 Size : 1024 Publisher : 王伟

算法ebook(10部算法经典著作的合集) 算法ebook> 10部算法经典著作的合集 chm格式 (1)Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni (2)Data Structures, Algorithms and Program Style Using C by James F. Korsh and Leonard J. Garrett (3)Data Structures and Algorithm Analysis in C by Mark Allen Weiss (4)Data Structures: From Arrays to Priority Queues by Wayne Amsbury (5)Information Retrieval: Data Structures & Algorithms edited by William B. Frakes and Ricardo Baeza-Yates (6)Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest (7)Practical Data Structures in C++ by Bryan Flamig (8)Reliable Data Structures in C by Thomas Plum (9)Data Structures and Algorithms Alfred V. Aho, Bell Laboratories, Murray Hill, New Jersey John E. Hopcroft, Cornell University, Ithaca, New York Jeffrey D. Ullman, Stanford University, Stanford, California (10)DDJ Algorithms and Data Structures Articles-algorithm ebook (10 Algorithm classics Collection) algorithm ebookgt; Gt; Ten algorithm classics Collection chm format (1) Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni (2) Data Structures and Algorithms and Program Using C by Style Asperula and James F. Leonard J. Garrett (3) Data Structures and Analysis Algorithm in C by Mark Allen Weiss (4) Data Structures : From Arrays to Priority Queues by Wayne Amsbury (5) Information Retrieval : Data Structures Algorithms edited by William B . Frakes and Ricardo Baeza- Yates (6) Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest (7) Practical Data Structures in C by Bryan Flamig (8) Reliable Data Structures in C by Thomas Plum (9) Data Structures and Algorithms Alfred V. Aho, Bell Laborat
Update : 2024-05-14 Size : 29000704 Publisher : 狼狼

五个常用的排序方法,用C实现的,包括归并,插入,希尔,快速,冒泡-five commonly used sequencing method, the C achieved, including merging, inserting, Hill, rapid and Bubble
Update : 2024-05-14 Size : 3072 Publisher : soul

用VB实现的函数的极致和最优化 包括黄金分割搜索法、不用导数的布伦特法 用导数的布伦特法、多元函数的山单纯形法、多元函数的变尺度法等-VB function of the body and optimization including 0.618 search, not derivative Brent Act, Brent derivative, the multi-function Hill simplex method, the multi-function as a criterion
Update : 2024-05-14 Size : 7168 Publisher : 刘立立

实现了插入排序,希尔排序, 冒泡排序,快速排序,选择排序,堆排序和归并排序,以及可以对排序的性能进行分析,较适合用作排序算法的学习-achieved insertion sort, Hill, in order Bubble Sort, quick sort, select, in order of ranking and sculpture merge sorting, and sequencing can analyze the performance and more appropriate for the learning algorithm
Update : 2024-05-14 Size : 1902592 Publisher : 叶靥

用 插入排序, 希尔排序 ,冒泡, 快速排序 , 选择排序 ,堆排序, 归并排序 实现对任意随机数序列,并比较各种方法的运行快慢和复杂度-with insertion sort, Hill sequencing, bubbling Quick Sort, select, in order of ranking sculpture, merging order to achieve arbitrary random series, and compare the various methods of operating speed and complexity
Update : 2024-05-14 Size : 880640 Publisher : 陈婷

DL : 0
很好的一个DD。。 能够进行快速排序...利用C语言实现,8种排序算法! 例如:插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序!-good a DD. . To conduct rapid sequencing ... use C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hill sorting, merging, in order of ranking base!
Update : 2024-05-14 Size : 5120 Publisher : 333

Parallel programming/Lou Baker, Bradley J.Smith .—New York:McGraw-Hill Book Co.,1996源码-Parallel programming/Lou Baker, Bradley J. Smith.- New York : McGraw-Hill Book Co.. 1996-source
Update : 2024-05-14 Size : 36864 Publisher : 钱锋

几种排序算法的C语言实现 用函数实现如下算法: (1) 直接插入排序, 希尔排序 (2) 冒泡排序, 快速排序 (3) 选择排序, 堆排序 (4) 归并排序 (5) 基数排序 -several algorithm using C language function algorithm to achieve the following : (a) direct insertion sort, Hill sequencing (2) Bubble Sort, rapid sequencing (3) choose, in order of ranking reactor (4) Merging Sort (5) Sort base
Update : 2024-05-14 Size : 4096 Publisher : 丘方

DL : 0
68013 gpif模式的使用说明,详细代码可以在众山公司下载-68,013 gpif pattern of the use of detailed description of the code can be downloaded from the public Hill Companies
Update : 2024-05-14 Size : 229376 Publisher : 王哲

DL : 0
拓扑,直接插入,冒泡,简单选择,希尔 ,快速,堆排序-topology, direct insertion, bubbling simple choice, Hill, rapid and Heap Sort
Update : 2024-05-14 Size : 1247232 Publisher : 李伟然

DL : 0
血液细胞边缘提取系统,有直方图分析等,详细请见压缩包内-blood cell edge extraction system, a histogram analysis, detailed see compressed within
Update : 2024-05-14 Size : 827392 Publisher : 开力

[C-#高级编程].McGraw.Hill.-.Advanced.C#.Programming.rar 不需要密码-[C-# Advanced Programming]. McGraw.Hill .-. Advanced.C#. no password Programming.rar
Update : 2024-05-14 Size : 9909248 Publisher : fly

C++ Demystified: A Self-Teaching Guide by Jeff Kent ISBN:0072253703 McGraw-Hill/Osborne © 2004 This hands-on, step-by-step resource will guide you through each phase of C++ programming, providing you with the foundation to discover how computer programs and programming languages work. -C Demystified : A Self-Teaching Guide by Jeff Kent ISBN : 0072253703 McGraw-Hill/Osborne
Update : 2024-05-14 Size : 2637824 Publisher : 李小钱

附有本人超级详细解释(看不懂的面壁十天!) 一、 实际问题: 希尔排序(Shell Sort)是插入排序的一种。因D.L.Shell于1959年提出而得名。它又称“缩小增量分类法”,在时间效率上比插入、比较、冒泡等排序算法有了较大改进。能对无序序列按一定规律进行排序。 二、数学模型: 先取一个小于n的整数d1作为第一个增量,把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接插人排序;然后,取第二个增量d2<d1重复上述的分组和排序,直至所取的增量dt=1(dt<dt-l<…<d2<d1),即所有记录放在同一组中进行直接插入排序为止。该方法实质上是一种分组插入方法。 三、算法设计: 1、将相隔某个增量dlta[k]的元素构成一个子序列。在排序过程中,逐次减小这个增量,最后当h减到1时,进行一次插入排序,排序就完成。增量序列一般采用:dlta[k]=2t-k+1-1,其中t为排序趟数,1≤k≤t≤[log2 (n+1)],其中n为待排序序列的长度。按增量序列dlta[0..t-1]。 2、按增量dlta[k](1≤k≤t≤[log2 (n+1)])进行一趟希尔插入排序。 3、在主函数中控制程序执行流程。 4、时间复杂度:1≤k≤t≤[log2 (n+1)]时为O(n3/2)。 -with super detailed explanation (not read the Wall for 10 days!) A practical question : Sort Hill (Shell Sort) is inserted into a sort. By D. L. Shell made in 1959 and named after. It is also known as the "narrow incremental method" in the time-efficient than inserted, such as sorting algorithms and bubbling there has been a big improvement. The disorder can sequence by law must rank. Two mathematical models : first getting a less than n integers d1 as an increment. all documents should be recorded into d1 groups. All distance dl in multiples of record on the same group. In the first group for direct insertion sorting; Then, take a second increment d2
Update : 2024-05-14 Size : 19456 Publisher : 乐乐

DL : 0
经典的希尔排序算法,对大家学习数据结构及培养编程思想有所启发!-classic Hill sorting algorithm for data to study the structure and culture programming philosophy inspired!
Update : 2024-05-14 Size : 5120 Publisher : 阿科

学习数据结构写的排序代码,有冒泡排序、直接插入、希尔排序、简单选择排序、快速排序、堆排序-study data structure was sort of code, Bubble Sort directly inserted, Hill, in order of simple choice, in order of Quick Sort, Heap Sort
Update : 2024-05-14 Size : 370688 Publisher : 陈飞

本例展示了D3D9.0中使用顶点着色器(Vertex Shader, *.vsh)绘制的过程。 本例运行的软硬件环境: Visual C++ 7.0 Direct3D 9.0 盛崇山版权所有-the cases demonstrate the use of D3D9.0 vertex coloring (Vertex Shader.*. vsh) preparation process. The cases run the hardware and software environment : Visual C 7.0 9.0 Direct3D Hill only Chengchong
Update : 2024-05-14 Size : 128000 Publisher : 漫步者

插入排序,希尔排序,冒泡排序,快速排序,选择排序程序实现。-insertion sort, Hill, ranked bubble sort, quick sort, select Sort program.
Update : 2024-05-14 Size : 1024 Publisher : 飞鸿
« 1 2 ... 12 13 14 15 16 1718 19 20 21 22 ... 50 »
DSSZ is the largest source code store in internet!
Contact us :
1999-2046 DSSZ All Rights Reserved.