Search - heap sort

Search - heap sort - List

[Data structs] 各种排序比较 DL : 0: 分别实现直接插入排序、冒泡排序、简单选择排序、希尔排序、快速排序、堆排序，并随机生成30个数，比较各算法的时、空性能和稳定性。-respectively direct insertion sort, bubble sort, simple choice, in order of ranking Hill, the quick sort, heap sort, and Random Number Generation 30, a comparison algorithm, the performance and stability of the air.
Date : 2025-12-30 Size : 334kb User : 李景良
[Data structs] ds_kcsj_cxc DL : 0: 《数据结构》排序演示系统。实现6种内部排序。包括直接插入排序，希尔排序，冒泡排序，直接选择排序，快速排序，堆排序。。这是我的数据结构课程设计！-"data structure" Sort demonstration system. Six species of achieving internal order. Including direct insertion sort, Hill, in order Bubble Sort, direct selection, in order of Quick Sort, heap sort. . This is my data structure course design!
Date : 2025-12-30 Size : 314kb User : 程相闯
[Data structs] 排序算法－java DL : 0: 用java实现的数据结构排序算法，包括：选择排序、插入排序、冒泡排序、希尔排序、快速排序、堆排序、归并排序。-used to achieve the ranking algorithm data structure, including : Select, in order of insertion sequence and Bubble Sort, Hill sequencing, rapid sequencing, heap sort, merging sequencing.
Date : 2025-12-30 Size : 53kb User : 陈为
[Data structs] 排序和查找 DL : 0: 常用的数据结构排序和查找算法:简单选择排序,冒泡排序,折半插入排序,快速排序,堆排序顺序查找,折半查找.-commonly used data structures sorting and searching algorithms : simple choice, in order of Bubble Sort, half insertion sort, rapid sequencing, Heap Sort sequence search, binary search.
Date : 2025-12-30 Size : 2kb User :
[Data structs] sort DL : 0: 利用随机函数产生30000个随机整数，利用插入排序、起泡排序、选择排序、快速排序、堆排序、归并排序等排序方法进行排序，并统计每一种排序上机所花费的时间-Using random functions to generate 30,000 random integers, the use of insertion sort, bubbling sort, select sort, quick sort, heap sort, merge sort and other sorting methods to sort and sort each type of statistics on the time machine
Date : 2025-12-30 Size : 4kb User : sufei
[Data structs] sort DL : 1: 这是数据结构的课程设计，对起泡排序、直接排序、简单选择排序、快速排序、希尔排序和堆排序算法进行比较和分析，C语言实现。-This is the data structure of the curriculum design, sort of sparkling, direct sequencing, a simple selection sort, quick sort, Hill sort and heap sort algorithm comparison and analysis, C language.
Date : 2025-12-30 Size : 192kb User : Anse
[Data structs] sort DL : 0: 随机产生个整数n=100，200，300，1000，2000个整数并存于数组r[1..n]中。对主要查找算法（顺序查找、插入排序、冒泡排序、堆排序、快速排序）进行实验比较，计算出平均比较次数、平均移动次数及执行时间。由程序自动计算.-Randomly generated integers integers n = 100,200,300,1000,2000 co-exist in the array r [1 .. n] in. On the main search algorithm (the order of search, Insertion Sort, Bubble Sort, Heap Sort, Quick Sort) for the comparison, the calculated average number of comparison, the average mobile number and execution time. Automatically calculated by the procedure.
Date : 2025-12-30 Size : 17kb User : 侯健
[Data structs] Sort DL : 1: 数据结构与算法的排序算法演示,这是我上大学的时候做的实验,里面展示了几种常用的排序算法的算法演示,如插入排序,选择排序,快速排序,堆排序.-Data structure and algorithm of the sorting algorithm demo, this is my time to college to do the experiment, which showed several common sorting algorithm presentation, such as insertion sort, selection sort, quick sort, heap sort.
Date : 2025-12-30 Size : 86kb User : THM
[Data structs] Heap-sort DL : 0: 堆积排序(Heapsort)是指利用堆积树（堆）这种资料结构所设计的一种排序算法，可以利用数组的特点快速定位指定索引的元素。 -Heap sort (Heapsort) is the use of stacked tree (heap) data structure designed such a sorting algorithm can take advantage of the characteristics of the array elements quickly locate the specified index.
Date : 2025-12-30 Size : 1kb User : mfeng
[Data structs] HEAP-sort-program DL : 0: 堆排序程序，对结构体数按某个值KEY的大小降序排序-Heap sort program, the number of structures according to the size of a value in descending order KEY
Date : 2025-12-30 Size : 1kb User : 李超
[Data structs] Deformation-heap-sort-algorithm DL : 0: 变形堆排序算法实现与性能比较，算法第一次作业。-Deformation heap sort algorithm and performance comparison
Date : 2025-12-30 Size : 1.27mb User : yerasel
[Data structs] Heap-sort DL : 0: 堆排序 MFC 显示初始化的堆和排序后的堆。-Heap sort heap and initialize MFC display sorted heap.
Date : 2025-12-30 Size : 28kb User : 凌珍珍
[Data structs] Heap-Sort DL : 0: 数据结构中所要了解及掌握的堆排序算法。-Data structure to understand and master of the heap sort algorithm. ~~~~~~
Date : 2025-12-30 Size : 22.77mb User : 黄崇远
[Data structs] heap-sort DL : 0: 利用堆排序从一系列的数中找出前k个小的数-Using heap sort from a series of numbers to find a small number of the first k
Date : 2025-12-30 Size : 1kb User : 闫海军
[Data structs] heap-sort DL : 0: 堆排序算法的实现，很早写的，应该有点借鉴意义-Heap Sort algorithm, early writing, and should learn a little bit
Date : 2025-12-30 Size : 7kb User : 张天
[Data structs] Heap-sort DL : 0: 堆排序　堆排序利用了大根堆（或小根堆）堆顶记录的关键字最大（或最小）这一特征，使得在当前无序区中选取最大（或最小）关键字的记录变得简单。　　（1）用大根堆排序的基本思想　　① 先将初始文件R[1..n]建成一个大根堆，此堆为初始的无序区　　② 再将关键字最大的记录R[1]（即堆顶）和无序区的最后一个记录R[n]交换，由此得到新的无序区R[1..n-1]和有序区R[n]，且满足R[1..n-1].keys≤R[n].key 　　③由于交换后新的根R[1]可能违反堆性质，故应将当前无序区R[1..n-1]调整为堆。然后再次将R[1..n-1]中关键字最大的记录R[1]和该区间的最后一个记录R[n-1]交换，由此得到新的无序区R[1..n-2]和有序区R[n-1..n]，且仍满足关系R[1..n-2].keys≤R[n-1..n].keys，同样要将R[1..n-2]调整为堆。　　…… 　　直到无序区只有一个元素为止。　　（2）大根堆排序算法的基本操作：　　① 初始化操作：将R[1..n]构造为初始堆；　　② 每一趟排序的基本操作：将当前无序区的堆顶记录R[1]和该区间的最后一个记录交换，然后将新的无序区调整为堆（亦称重建堆）。 -Heap sortHeap sort heap sort using the root pile ( or small stack stack top ) the record of the keyword maximum ( or minimum ) of this feature, the present disordered select the maximum (or minimum ) keyword records made simple. ( 1 ) with a large root heap sort of basic ideas of the initial file R[1..N] built a large root pile, the pile as the initial disordered regions of the keywords maximum recorded R[1] (i.e. top ) and disordered regions recorded one of the last R[n] exchange, the new R [1..N-1] and disordered zone ordered region R[n], and satisfy the R[1..N-1].keys≤ R[n].key③due to exchange new root R[1] may violate the heap property, so should be the present disordered R[1..N-1] adjustment for reactor. Then again in the R[1..N-1] keyword best record R[1] and the interval of the last record of a R[n-1] exchange, thus get new disordered and ordered R[1..N-2] R[n-1..N], and still meet the relationship between R[1..N-2].keys≤ R[n-1..N].keys, R[1..N-2] also will adjust for reactor. .
Date : 2025-12-30 Size : 1kb User : 周杨
[Data structs] heap-sort DL : 0: 利用系统生成随机数，然后将生成的随机数进行堆排序堆排序-heap sort
Date : 2025-12-30 Size : 1kb User : 杨星
[Data structs] heap-sort-code DL : 0: c语言编写的堆排序算法，算法复杂度O(nlgn)-heap sort
Date : 2025-12-30 Size : 1kb User : zhao zhang
[Data structs] Heap-Sort DL : 0: It is the source code of the Heap Sort in C++. which is a data structure.-It is the source code of the Heap Sort in C++. which is a data structure.
Date : 2025-12-30 Size : 9kb User : waqasullahkhan
[Data structs] heap DL : 0: 利用C++实现了最大堆和最小堆的初始化，插入、删除操作，在此基础上实现了堆排序(On the basis of C++, the initialization, insertion and deletion of the maximum heap and the minimum heap are implemented. On this basis, the heap sort is implemented.)
Date : 2025-12-30 Size : 446kb User : Burylight

« 12 3 4 5 6 7 8 9 10 ... 17 »