Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - heap sort
Search - heap sort - List
1)实现以下常用的内部排序算法并对它们的时间效率进行比较: 必做(6种):起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序; 选做:折半插入、二路归并、基数排序等等; 2)函数首部要求:void XXXXSort(char **list, int len, int n, int *c, int *s) 其中: a) XXXXSort为排序函数名,具体如下: 起泡排序BubbleSort 直接插入排序InsertSort 简单选择排序SelectSort 快速排序QuickSort 希尔排序ShellSort 堆排序HeapSort 折半插入BInsertSort 二路归并Merge2Sort 基数排序RadixSort b) list为二维字符数组的头指针,该二维数组的规格为:char list[n][len] 每行用于存放一个字符串(最大长度为len-1),共n行; c) c用于返回关键字比较次数; d) s用于返回移动次数; 3)要求把各种排序函数做成函数库(文件名统一为:sort.c),用统一提供的主程序进行调用和测评。 -a) achieve the following commonly used internal sorting algorithm as well as their time efficiency comparison : regimen (6) : bubble sort, direct insertion sequence and simple choice sorting, quick sort, Hill, ranked Heap Sort; elected to do : half of insertion, two-way merge. Sort base, and so on; 2) function first requirement : void XXXXSort (char ** list, int len, int n, int * c, int * s) which : a) XXXXSort sort of a function name, as follows : bubble sort BubbleSort direct insertion sort InsertSort simple choice ranking Sele ctSort Quick Sort QuickSort Hill Sorting ShellSort Heap Sort HeapS ort half insert BInsertSort two-way merge Merge2Sort radix sort Radi xSort b) list for the two-dimensional array of characters in the first indicator, the two-dimensional array specifications : cha
Date : 2008-10-13 Size : 10.05kb User : 战天

1)实现以下常用的内部排序算法并对它们的时间效率进行比较: 必做(6种):起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序; 选做:折半插入、二路归并、基数排序等等; 2)函数首部要求:void XXXXSort(char **list, int len, int n, int *c, int *s) 其中: a) XXXXSort为排序函数名,具体如下: 起泡排序BubbleSort 直接插入排序InsertSort 简单选择排序SelectSort 快速排序QuickSort 希尔排序ShellSort 堆排序HeapSort 折半插入BInsertSort 二路归并Merge2Sort 基数排序RadixSort b) list为二维字符数组的头指针,该二维数组的规格为:char list[n][len] 每行用于存放一个字符串(最大长度为len-1),共n行; c) c用于返回关键字比较次数; d) s用于返回移动次数; 3)要求把各种排序函数做成函数库(文件名统一为:sort.c),用统一提供的主程序进行调用和测评。 -a) achieve the following commonly used internal sorting algorithm as well as their time efficiency comparison : regimen (6) : bubble sort, direct insertion sequence and simple choice sorting, quick sort, Hill, ranked Heap Sort; elected to do : half of insertion, two-way merge. Sort base, and so on; 2) function first requirement : void XXXXSort (char** list, int len, int n, int* c, int* s) which : a) XXXXSort sort of a function name, as follows : bubble sort BubbleSort direct insertion sort InsertSort simple choice ranking Sele ctSort Quick Sort QuickSort Hill Sorting ShellSort Heap Sort HeapS ort half insert BInsertSort two-way merge Merge2Sort radix sort Radi xSort b) list for the two-dimensional array of characters in the first indicator, the two-dimensional array specifications : cha
Date : 2025-12-30 Size : 10kb User : 战天

给定N个int类型(自定N的上限M,例如M=100000,N的取值不能少于10000)的整数,分别使用插入排序、快速排序、归并排序和堆排序方法进行升幂排序。-Int a given N-type (the upper limit of N self-M, for example, M = 100000, N value should not less than 10000) integer, respectively, using the insertion sort, quick sort, merge sort and heap sort methods or power sequencing.
Date : 2025-12-30 Size : 311kb User : nemo

实现了一种堆排序算法,堆排序利用了大根堆堆顶记录的关键字最大(或最小)这一特征,使得在当前无序区中选取最大(或最小)关键字的记录变得简单-The realization of a heap sort algorithm, HEAPSORT use of a large root piles Top keywords recorded the largest (or smallest) This feature, making the current disorder in the area, select the largest (or smallest) record simple keywords
Date : 2025-12-30 Size : 1.59mb User : 刘冠宇

产生随机数,并队随机数进行排序.利用随机函数产生N个随机整数(20000以上),对这些数进行多种方法进行排序。-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 : 1kb User : tan

一问题描述 设计一个测试程序比较几种内部排序算法的关键字比较次数和移动次数以取得直观感受。 二 基本要求 [1] 对起泡排序、直接排序、简单选择排序、快速排序、希尔排序、堆排序算法进行比较 [2] 待排序的元素的关键字为整数。其中的数据要用伪随机产生程序产生[如10000个],至少用5组不同的输入数据做比较,再使用各种算法对其进行排序,记录其排序时间,再汇总比较。 [3] 界面友好,易与操作。采用菜单方式进行选择。 [4] 选做内容 ① 对不同表长进行比较 ② 验证各算法的稳定性; ③ 输出界面的优化。 ④ 使用汉字显示。 -Problem Description 1 Design a testing procedure based on comparing several internal sorting algorithms compare the number of keywords and mobile number in order to obtain an intuitive feeling. Second, the basic requirements [1] of the foaming sort, direct sequencing, a simple selection sort, quick sort, Hill sort, heap sort algorithm to compare [2] to be sort of the elements of an integer keyword. One of the data generated using pseudo-random procedures [such as 10000], at least 5 different sets of input data to do comparison, the re-use of its various algorithms to sort and record the time of its sort, and then compare aggregate. [3] user-friendly, easy and operation. Manner using the menu selection. [4] Does the content of election ① on the long table to compare different ② verify the stability of the algorithm ③ Optimize output interface. ④ display Chinese characters are used.
Date : 2025-12-30 Size : 667kb User : xuqijun

包涵大部分的排序算法的C语言实现,包括插入排序,选择排序,堆排序,快速排序等-Covered most of the sorting algorithm of the C language implementation, including the insertion sort, selection sort, heap sort, quick sort, etc.
Date : 2025-12-30 Size : 1kb User : lili

这是三个排序程序源码:快速排序、堆排序、冒泡排序,供大家参考-This is sort of three procedures for source: Quick Sort, Heap Sort, Bubble Sort, for your reference
Date : 2025-12-30 Size : 2kb User : xuli

this rar file conatins all sorting methods such as heap sort,merge sort,insertion sort,quick sort....with simple coding
Date : 2025-12-30 Size : 2kb User : dass

用DEV C++写的,实现了堆及堆排序的算法。-With DEV C++ written a heap and the heap sort algorithm.
Date : 2025-12-30 Size : 8kb User : xiamin

用基于变治法的堆排序算法对任意一组给定的数据进行排序 设计与实现堆排序算法; 2)待排序的数据可以手工输入(通常规模比较小,10个数据左右),用以检测程序的正确性;也可以计算机随机生成(通常规模比较大,1500-3000个数据左右),用以检验(用计数法)堆排序算法的时间效率。-Variable-based treatment of the heap sorting algorithm to a set of arbitrary data set to sort the design and implementation of heap sort algorithm 2) to be sort of data can be entered manually (usually relatively small size of about 10 Data), to detect the correctness of the procedure also can be randomly generated computer (usually relatively large-scale data ,1500-3000 or so), to test (with counting) time sorting algorithm reactor efficiency.
Date : 2025-12-30 Size : 1kb User : lee

算法课上老师布置的实验。其中写了完整的选择排序,冒泡排序,堆排序和插入排序。希望对师弟师妹们有所帮助-Layout algorithm for class teachers experiment. One option was a complete sort, Bubble Sort, Heap Sort and Insertion Sort.师弟师妹who wish to help
Date : 2025-12-30 Size : 2kb User : 程扬

C语言的六种经典排序算法有冒泡、快速排序、希尔排序、插入、堆排序、简单选择排序-C language, there are six classic bubble sort algorithm, Quick Sort, Hill sort, insert, heap sort, a simple selection sort
Date : 2025-12-30 Size : 41kb User :

用MFC实现的关于内部排序算法的时间比较,包括快速排序,堆排序,选择排序等五种排序方法-Using MFC to achieve internal sorting algorithm on the time, including the Quick Sort, Heap Sort, select the sort method to sort five
Date : 2025-12-30 Size : 30kb User : 419756656

采用交互工作方式 (2)可以增加、删除、修改信息 (3)建立数据文件 ,数据文件按关键字(姓名、学号、房号)进行排序(选择、快速排序、堆排序等任选一种) (4) 查询 : a.按姓名查询 b.按学号查询 c按房号查询 (5) 打印任一查询结果(可以连续操作) 但是有些不全-The use of interactive methods of work (2) can add, delete, modify the information (3) the establishment of data files, data files by keyword (name, student number, room number) sort (selection, quick sort, heap sort, such as an optional ) (4) For inquiries: a. inquiries by name b. No. inquiries by school c No. inquiries by the Housing (5) print any results (continuous operation can be) but there are some incomplete
Date : 2025-12-30 Size : 581kb User : XH

给出了目前流行的直接插入排序、折半插入排序、希尔排序、冒泡排序、快速排序、简单选择排序、堆排序、归并排序、基数排序九种内部排序算法的c++源码,并对这些排序进行了分类和复杂度的分析,特别适合考研和学习数据结构的同学。-Are given directly into the popular sort, Insertion Sort half, Hill sort, bubble sort, quick sort, a simple choice to sort, heap sort, merge sort, nine base internal sorting algorithm to sort the c++ source code, and these Sort classified and complexity of the analysis, particularly suitable for study section of the data structure and learning of students.
Date : 2025-12-30 Size : 421kb User : huangjie

用C++编写的希尔排序与堆排序源代码,编译通过,可直接编译运行!-Written in C++, Shell sort and heap sort source code, compiles, can be directly translated to run!
Date : 2025-12-30 Size : 7kb User : 烟消云散

各种排序算法大全c++版 直接顺序排序、冒泡排序,选择,快排,希尔排序,堆排序,归并排序、筛选法调整堆、堆排序、一次归并、一趟归并法排序、归并排序的非递归算法、归并排序的递归算法、将两个已排序的子序列归并。-Various sorting algorithms Daquan c++ version of the direct order sort, bubble sort, select, quick row, shell sort, heap sort, merge sort, filter method to adjust the heap, heap sort, merge once, a trip to conquer method sort, merge sort non-recursive algorithms, merge sort recursive algorithm, the two sorted sequences merge.
Date : 2025-12-30 Size : 2kb User : gxtxtplg

利用随机函数产生 N 个随机整数(N = 500,1000,1500,2000,2500,…,30000), 利用直接插入排序、折半插入排序,起泡排序、快速排序、选择排序、堆排序,基数 排序七种排序方法(可添加其它排序方法)进行排序(结果为由小到大的顺序),并统 计每一种排序所耗费的时间(即比较次数)和**交换次数**。 [基本要求] (1) 原始数据存在文件中,每个整数一行,方便读入。 (2) 屏幕显示每种排序所花的比较次数。-Using the random function generates a random integer N (N = 500,1000,1500,2000,2500, ..., 30000), using direct insertion sort, binary insertion sort, bubble sort, quick sort, select, sort, heap sort, radix sort Seven sorting method (you can add other sorting methods) sort (ascending order of results), and statistics for each time-consuming sorting (ie, the number of comparisons)** and** the number of exchanges. [Basic requirements] (1) the existence of the original data file, each integer line, easy to read. (2) Each screen displays the number of comparisons spent sorting.
Date : 2025-12-30 Size : 263kb User : 真真

程序包含了大部分排序算法的源代码,包括基数排序、堆排序等等(The program contains the source code of most sorting algorithms, including cardinality sort, heap sort, and so on.)
Date : 2025-12-30 Size : 3kb User : 拂漪
« 12 3 »
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.