Location:
Search - heapsort
Search list
Description: 将输入数字序列建成堆,用c语言实现堆排序.
Platform: |
Size: 826 |
Author: zhanglei |
Hits:
Description: 实现heap排序的算法，首先把Heap建立起来，然后通过对Heap的根节点来找出当前最小的节点，依次就可以实现排序了。-achieve heap sorting algorithm to first establish Run, then Run right through the current nodes to identify the smallest nodes can be followed to achieve the ranking.
Platform: |
Size: 1258 |
Author: 韩希先 |
Hits:
Description: 5 sort routins: Simple Selection Sort, HEAPSORT Insertion Sort, Hill sort, Bubble Sort, Quick sort
Platform: |
Size: 2905 |
Author: besoyal@yahoo.gr |
Hits:
Description: 快速排序模板-Quick sort template
Platform: |
Size: 1024 |
Author: 站长 |
Hits:
Description: c语言排序-c language sort
Platform: |
Size: 1024 |
Author: daimi |
Hits:
Description: 该系统是本人课程设计作业，因为时间关系，只用了两天多的时间编成。所以有很多地方没有得到增强。版本为1.0。现作以下升级。 增加NEW，OPEN版本。 提高输入容错。判断输入的对错。 时间关系，搜索功能为线性搜索，现增强如下：f_search:费氏查找法；btree:二叉树查找法；l_search：线性查找法； r_search：递归折半查找法；zcsear:杂凑碰撞查找法；o_sear:插补查找加强法； 排序是冒泡法，现增强为：heaps:累堆排序；binary：二叉树排序；xieer：谢耳排序；sinsert：插入排序；quicks:快速排序；select:选择排序法； 有时间不仿试试。-f_search: Find Act Fernandez btree: binary tree search method l_search: linear search method r_search: Recursive half Find Law zcsear: Find a hash collision law o_sear: interpolation search Enhancement Act sort is bubbling method are enhanced for: heaps: HEAPSORT tired binary: binary tree sort xieer: Xie ears sort sinsert: Insertion Sort quicks: quick sort select: Select Sort Method
Platform: |
Size: 5120 |
Author: 游鸿明 |
Hits:
Description: 我写的数据结构小程序是关于排序算法的，功能比较全-I write the data structure of small programs algorithm, the entire comparison function
Platform: |
Size: 1024 |
Author: 王pp |
Hits:
Description: 一个关于headsort 和 quicksort 比较的程序,从这个例子可以看出在各个不同的情况下,headsort 和 quicksort 做了多少次比较. -headsort on a comparison of quicksort and procedures from this example can be seen in various circumstances, and quicksort headsort done a number of times earlier.
Platform: |
Size: 39936 |
Author: |
Hits:
Description: 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
Platform: |
Size: 10240 |
Author: 战天 |
Hits:
Description: 算法中的堆排序算法的实现-algorithm Heap Sort algorithm.
Platform: |
Size: 9216 |
Author: 张应 |
Hits:
Description: 因为不同的排序方法适应不同的应用环境和要求，所以选择合适的排序方法应综合考虑下列因素：
①待排序的记录数目n；
②记录的大小(规模)；
③关键字的结构及其初始状态；
④对稳定性的要求；
⑤语言工具的条件；
⑥存储结构；
⑦时间和辅助空间复杂度等。
本程序对以下7种常用的内部排序算法进行实测比较：插入排序、希尔排序、起泡排序、快速排序、归并排序、选择排序、堆排序。我主要负责的是希尔排序和堆排序。
-Because of different methods to sort of adapt to different application environments and requirements, so choose the right sort of approach should consider the following factors: ① the number of records to be sorted n ② record size (scale) ③ keyword structure and initial state ④ stability requirements ⑤ conditions Language Tools ⑥ storage structure ⑦ time and space complexity, such as auxiliary. This procedure on the following seven kinds of commonly used sorting algorithm to the measured internal comparison: Insertion Sort, Hill sorting, foaming sort, quick sort, merge sort, selection sort, heap sort. I mainly responsible for sequencing and HEAPSORT Hill.
Platform: |
Size: 1129472 |
Author: haitty |
Hits:
Description: 使用堆排序实现Pop, Push的算法. Push: 最小的元素永远位于堆顶-HEAPSORT realize the use of Pop, Push algorithm. Push: the smallest element Forever at top of heap
Platform: |
Size: 3072 |
Author: jiangxiaogen |
Hits:
Description: C语言实现 排序源程序(包括直接插入、希尔、冒泡、快速、简单选择、堆排序-C language source code sort (including direct insertion, Hill, bubble, quick, simple choice HEAPSORT
Platform: |
Size: 6144 |
Author: HEYINGPING |
Hits:
Description: 序综合
摘要：《排序综合》是利用随机函数产生N个随机整数（2000以上），对这些数进行多种方法进行排序。这次设计用了三种排序方法，即插入排序、希尔排序和堆排序。我们这个设计将对所设计的问题、系统所完成的功能进行详细的描述，并论述设计的问题设计思想、方法及方案，还会把设计软件的测试数据及测试结果粘贴上去，并对测试方法进行详细的描述。最后还有对所设计的软件的自我评价。
关键字：设计思想 功能 测试方法
-Comprehensive summary of sequence: sort comprehensive is the use of random functions to generate random integer N (2000 above), the number of these sort a number of ways. The design of the three sequencing methods used, that is, insertion sort, sort and HEAPSORT Hill. We will design this design problem, the system function of the completion of a detailed description, and discusses the design of design ideas, methods and programs, but also the design of software test data and test results pasted up, and test methods a detailed description. Finally, there is software designed for self-evaluation. Keywords: design thinking method of functional testing
Platform: |
Size: 148480 |
Author: 可拉 |
Hits:
Description: 希尔排序和折半查找的程序，可以运行。
数据类型是整形。-Hill sorting and half to find the procedure, you can run. Data type is plastic.
Platform: |
Size: 1024 |
Author: 吴超 |
Hits:
Description: vc++实现堆排序功能，属于数据结构习题-vc++ achieve HEAPSORT functions, data structures belonging to Exercises
Platform: |
Size: 158720 |
Author: 张婷 |
Hits:
Description: C语言实现对文件的基本操作,包括对文件的写入,对写如内容的修改等,使用堆排序实现-C Language Implementation of the basic operation of the document, including document writing, content writing, such as changes and amendments so as to achieve the use of HEAPSORT
Platform: |
Size: 4096 |
Author: 吴木荣 |
Hits:
Description: C语言精彩百例第71－93例
第三篇 常用算法篇
实例71 链表的建立
实例72 链表的基本操作
实例73 队列的应用
实例74 堆栈的应用
实例75 串的应用
实???76 树的基本操作
实例77 冒泡排序法
实例78 堆排序
实例79 归并排序
实例80 磁盘文件排序
实例81 顺序查找
实例82 二分法查找
实例83 树的动态查找
实例84 二分法求解方程
实例85 牛顿迭代法求解方程
实例86 弦截法求解方程
实例87 拉格朗日插值
实例88 最小二乘法拟合
实例89 辛普生数值积分
实例90 改进欧拉法
实例91 龙格-库塔法
实例92 高斯消去法
实例93 正定矩阵求逆-C-100 cases of the first 71-93 cases of brilliant third chapter examples of commonly used algorithm list 71 list 72 examples of the establishment of the basic operation examples of the application of 73 queue 74 application stack 75 is the application of string??? 76 trees Examples of the basic operation of Act 77 of Bubble Sort Example 78 Example 79 HEAPSORT merge sort examples 80 examples of disk file to sort the order of 81 to find 82 examples of the dichotomy to find examples of 83 trees to find examples of the dynamics of 84 black-and-white examples of solving equations 85 Newton iteration method Example 86 string cut-off equation method Lagrange interpolation equation examples 87 examples of 88 examples of least square method 89 Simpson numerical integration example 90 examples 91 Improved Euler method Runge- Kutta method Gaussian elimination example 92 examples 93 positive definite matrix inversion
Platform: |
Size: 22528 |
Author: 杨志亮 |
Hits:
Description: 简易学生信息管理系统
程序实现思路：
先创建一个学生元素类，用于存放学生的各种数据。然后创建一个堆(heap)类，把数据以堆的形式存储，可便进行堆排序及各种操作。最后再用一个类(class priQueue)包装了heap类，以方便主函数调用。本程序中比较核心的技术就是用到了堆排序，将学生按优先级（高的排前面，低的排后面）的大小进行有序排列。堆排序的时间复杂度较一般排序（如：冒泡，选择等）来得低，可使程序显示数据时效率更高。-Simple Student Information Management System program ideas: the first element to create a student class, students used to store various data. And then create a stack (heap) type, the data in order to stack the form of storage, can be carried out and various operation HEAPSORT. Finally, re-use a class (class priQueue) type of packaging the heap in order to facilitate the main function call. Comparison of this procedure is the core technology used in the heap sort students by priority (high in front of the row, low row behind) the size of orderly arrangement. HEAPSORT time complexity of a more general sort (eg: bubble, choose, etc.) too low, the procedure can show the data more efficient.
Platform: |
Size: 136192 |
Author: est |
Hits:
Description: 练习堆排序算法，将存放于数组中的一系列数通过堆将其排好序。-Practice HEAPSORT algorithm, will be stored in the array through a series of several of its lined reactor sequence.
Platform: |
Size: 8192 |
Author: 刘慧 |
Hits:
«
1
2
3
4
56
7
8
9
10
...
14
»