Search - shell - CodeBus

Search - shell - List

[Data structs] 简单数据结构的实现 DL : 0

Shell 排序

单链表

堆排序

简单二叉树

快速排序

冒泡排序

数组生成最小堆

杨辉三角形

Date : 2008-05-05 Size : 5.06kb User : auskalia

[Data structs] cvcjc DL : 0

SHELL排序算法与应用-SHELL algorithm and application
Date : 2025-12-22 Size : 239kb User : 王金华

[Data structs] 实现各种排序算法并分析与比较 DL : 0

本程序实现各种排序算法并分析与比较直接插入排序， SHELL排序，冒泡排序，快速排序，简单选择排序，堆排序，归并排序-procedures for the realization of the algorithm and analysis more directly inserted, in order of ranking SHELL, Bubble Sort, rapid sequencing, simple choice, in order of ranking sculpture, merging Sorting
Date : 2025-12-22 Size : 3kb User : 李南宁

[Data structs] paixu DL : 0

各种排序算法，ＳＨＥＬＬ　ＭＥＲＧＥ，还有随机数的生成　-various sequencing algorithms, SHELL Merg, Random Number Generation
Date : 2025-12-22 Size : 341kb User : 和上面

[Data structs] sort_method DL : 0

各种排序算法，包括快速排序、插入排序、选择排序、SHELL排序-various sorting algorithms, including rapid sorting, insertion sort, select, in order of ranking SHELL
Date : 2025-12-22 Size : 3kb User : 范凯生

[Data structs] 科技（1） B 064 04 DL : 0

某国为了防御敌国的导弹袭击，发展出一种导弹拦截系统，但是这样的导弹拦截系统有个缺陷，虽然他的第一发炮弹能够达到任意高度，但是以后每一发炮弹都不能高于前一发的高度。某一天，雷达捕捉到敌国的导弹来袭。由于该系统还在使用阶段，所以只有一套系统，因此有可能不能拦截所有的导弹。输入导弹依次飞来的高度（雷达给出高度数据是不大于30000的整数），计算这套系统最多能拦截多少导弹，如果要拦截所有的导弹最少配备多少套这种导弹系统。三；问题分析：该系统的第一发炮弹能够达到任意高度，所以要求出系统最多能够拦截的导弹数，其实就是在求一个最长的下降序列。要求出系统拦截所有的导弹至少需要配备的套数，可用贪婪算法，采用数组记录导弹数量和导弹的分类，算出数组的元素个数即为系统的套数。 -a country to defend against enemy missile attacks, the development of a missile interception system, but such a missile interceptor system has a flaw, though his first rounds to achieve highly arbitrary, but each shell and should not be higher than the former was too high. One day, the radar to capture incoming enemy missiles. As the system is still in use stage, only a system, it is not possible to intercept all missiles. The importation of missile followed the flying height (height of the radar data is not more than 30,000 of the integer), the system calculated the maximum number of interceptor missiles to intercept all missiles with a minimum number of sets of such missile systems. 3; Analysis : The system of the first rounds of arbitrary height can be achieved, requires the system to t
Date : 2025-12-22 Size : 6kb User : 王俊

[Data structs] 排序算法、字典和B-树的C++语言实现 DL : 1

排序算法、字典和B-树的C++语言实现代码内容包括以下算法： qui.c sort: quicksort qsort.c sort: qsort ins.c sort: insert sort shl.c sort: shell sort has.c dictionary: hash tables bin.c dictionary: binary tree rbt.c dictionary: red-black trees skl.c dictionary: skip lists ext.c external sort btr.c btree 语言 C++ 编译平台 Visual C++ 作者 Thomas Niemann 备注来自Sorting and Searching Algorithms:A Cookbook-algorithm, dictionaries and B-Tree C language code include the following algorithm : qui.c sort : quicksort qsort.c sort : qsort ins.c sort : insert sort shl.c sort : shell sort has.c dictionary : hash tables bin.c dictionary : binary tree rbt.c dictionary : red-black trees skl.c dictionary : skip lists ext.c external sort btr.c BTREE Part C language Visual C platform translated author Thomas Niemann Remarks from the Sorting and S earching Algorithms : A Cookbook
Date : 2025-12-22 Size : 24kb User : 罗鹏魁

[Data structs] shellsort111 DL : 1

附有本人超级详细解释（看不懂的面壁十天！）一、实际问题: 希尔排序(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
Date : 2025-12-22 Size : 19kb User : 乐乐

[Data structs] DEMO(sort) DL : 0

实现各种内部排序。包括冒泡排序，直接插入排序，Shell排序，快速排序，堆排序，并比较排序的比较次数和移动次数。主要是C语言。-achieve internal order. Including bubble sort, direct insertion sort, Shell sort, quick sort, heap sort, and compare the ranking of number and mobile number. C is the main language.
Date : 2025-12-22 Size : 212kb User : 张某某

[Data structs] SHELL DL : 0

算法排序希尔排序 sheelsorting -Sort algorithm to sort sheelsorting Hill
Date : 2025-12-22 Size : 1kb User : jo

[Data structs] Shell_MergeSorting DL : 0

同时对Shell排序和归并排序进行了实现,并且打印了每趟的结果-At the same time, Shell sort and merge sort carried out to achieve, and print the results of each trip
Date : 2025-12-22 Size : 8kb User : 史

[Data structs] allkindsofsort DL : 0

各种排序算法设计。包括简单的：冒泡，比较，选择，shell 和复杂的：快速，堆，二路归并排序-The design of various sorting algorithms. Including simple: bubble, compare, choose, shell and complex: Fast, heap, merge sort Rd
Date : 2025-12-22 Size : 1.19mb User : 好好的

[Data structs] SortAlgorithmInJava DL : 0

java中几种常用的排序算法。用Java语言实现的各种排序，包括插入排序、冒泡排序、选择排序、Shell排序、快速排序、归并排序、堆排序、SortUtil等。-java of several commonly used sorting algorithm. Using Java language to achieve a variety of sorting, including the Insertion Sort, Bubble Sort, Selection Sort, Shell Sort, Quick Sort, Merge Sort, Heap Sort, SortUtil such.
Date : 2025-12-22 Size : 3kb User : alonso

[Data structs] shell DL : 0

shell排序:当增量d=1jf ,ShellPass和InsertSort基本一致,只是由于没有哨兵而在内循环中增加了一个循环判定条件"j>0",以防下标越界.-shell
Date : 2025-12-22 Size : 1kb User : andy

[Data structs] shell DL : 0

希尔排序，希尔排序， c语言-shell sort
Date : 2025-12-22 Size : 1.61mb User : fanfan

[Data structs] Shell DL : 0

一种shell排序方法，能够取得很好的效果，希望对大家有所帮助。-A shell sort method, can achieve good results, we want to help.
Date : 2025-12-22 Size : 839kb User : 胡恢军

[Data structs] Shell-Sort DL : 0

对{9,8,7,6,5,4,3,2,1,0}，采用希尔排序(Shell Sort)，d=5,2,1,输出每趟排序结果。-Of {9,8,7,6,5,4,3,2,1,0}, using the shell sort (Shell Sort), d = 5,2,1, sorting out the results of each trip.
Date : 2025-12-22 Size : 7kb User : lsy

[Data structs] shell DL : 0

一个关于shell排序的代码，很实用，而且效率高。-A shell of the sort of code, very practical, and high efficiency.
Date : 2025-12-22 Size : 1kb User : 啊威

[Data structs] shell-sort DL : 0

数据结构排序算法之希尔排序法，此算法用C++编程语言书写特别适合初学数据结构的人学习。-Data structures sorting algorithm shell sort, this algorithm using C++ written in a programming language particularly suitable for beginner data structure of human learning.
Date : 2025-12-22 Size : 1kb User : 满达

[Data structs] Shell-Sort DL : 0

谢尔排序可以看作是一种插入排序的扩展方法与插入排序法相同的是，它们都是可以看作是一个个新的元素插入到已排好的数组里面的不同点是，在普通的插入排序法中，它是一个个元素比较，而在Shell s Sort中，相对多了一个步骤，改了一个步骤,其实两个合起来的改动就是多了一个概念，一个分治的概念,从代码实现的角度来看的话，就是多了一个调整步进的变量。-The Rochelle sort can be seen as an extension method of insertion sort and insertion sort same, they are seen as a new element is inserted into the scheduled inside the array difference is that, in the ordinary insertion sort, it is one element in Shell' s sort, relatively more of a step change in one step, two changes together is more than a concept, a concept of divide and conquer, from the code implementation point of view, that is, the a variable adjustment step.
Date : 2025-12-22 Size : 10kb User : alinder

« 12 3 4 5 6 »