Location:
Search - heapsort
Search list
Description: 实现堆排序算法，里面自带了一个例子，是初学者必学的一个数据结构算法-Heap sorting algorithm implementation, which comes with an example, a beginner must learn a data structure algorithms
Platform: |
Size: 1024 |
Author: csc |
Hits:
Description: 堆排序的数字和字母两种不同的图形界面实现，暑期课程设计作业而已-Heap sort of numbers and letters to achieve two different graphical interface, summer curriculum work only ~ ~ ~
Platform: |
Size: 3735552 |
Author: 黄毅骏 |
Hits:
Description: 堆排序，可分大堆和小堆两种，可实现堆的插入，删除，遍历-Heap sort, can be divided into two piles and small heap, the heap can be realized insert, delete, traverse
Platform: |
Size: 1024 |
Author: 文月如 |
Hits:
Description: heap sorting algorithm in java souce code
Platform: |
Size: 10240 |
Author: hasan |
Hits:
Description: heap sort promising technique
Platform: |
Size: 40960 |
Author: praveen |
Hits:
Description: 对int类型的数据进行排序操作，包括bubblesort，insertsort，heapsort，quicksort以及countingsort-sorting some int numbers
Platform: |
Size: 3392512 |
Author: 王强 |
Hits:
Description: 堆排序的模拟程序 自己写的 仅供交流-Heap sort of the simulation program written only for their own communication
Platform: |
Size: 13312 |
Author: 邓彪 |
Hits:
Description: 算法与数据结构（C 版）[漆涛][程序源代码]
AAtree AvlTree Bstree Deap ds_codesAndProjectsV1(20090530) EightQueen FibonacciHeap Fmsets graph HeapSort IndirectSort InsertSort MergeSort MaxHeapAndMinHeapMatrix List Stack StringTreap Vector-Algorithms and Data Structures (C Edition) [paint Tao] [source code] AAtree AvlTree Bstree Deap ds_codesAndProjectsV1(20090530) EightQueen FibonacciHeap Fmsets graph HeapSort IndirectSort InsertSort MergeSort MaxHeapAndMinHeapMatrix List Stack StringTreap Vector
Platform: |
Size: 628736 |
Author: mabod |
Hits:
Description: Sorting by Heapsort and Mergesort algorithms.
===================================
Input file：H01dat.txt
----------------------------
包含第一列為n a b
第二列以後為a1 a2 a3 a4 ...... an
n：要排序的輸入資料數。
ai：要排序的資料，以space 或換行隔開，程式要能自行判斷資料輸入到n筆為止。
-------------------------------------Output：使用標準輸出〈即輸出到螢幕〉
-------------------------------------a：若a = 1，使用heapsort；若a = 2，使用mergesort。
b：若b = 1，則顯示排序後的結果〈由小到大〉；
若b = 2 且a = 1，則輸出Heapsort前兩次的過程(包含Heapify 過程)；
若b = 2 且a = 2，Megersort 則輸出前五次sort 的過程。
-Sorting by Heapsort and Mergesort algorithms. =================================== Input file: H01dat.txt--------------------------- nab the second column contains the first column after the a1 a2 a3 a4 ...... an n: to the number of input data sorted. ai: to sort the data, separated by space or newline, the program must be able to judge for themselves the information input to the n pen up.------------------------------------- Output: standard output < that is output to the screen> ------------------------------------ a: if a = 1, using the heapsort if a = 2, using mergesort. b: If b = 1, then display the results sorted < steeled> if b = 2 and a = 1, the output Heapsort during the last two (including Heapify process) if a = b = 2 and 2, Megersort sort the output process of the previous five.
Platform: |
Size: 7168 |
Author: cjwang |
Hits:
Description: 1、问题描述
设平面上分布着n个白点和n个黑点,每个点用一对坐标(x, y)表示.一个黑点b=(xb,yb)支配一个白点w=(xw, yw)当且仅当xb>=xw和yb>=yw.若黑点b支配白点w,则黑点b和白点w可匹配(可形成一个匹配对).在一个黑点最多只能与一个白点匹配,一个白点最多只能与一个黑点匹配的前提下,求n个白点和n个黑点的最大匹配对数.
2、具体要求
要求:时间效率在O(NlgN)
3、实现方法
基于贪心算法
以x坐标的升序对黑点排序(可用QUICKSORT或者HEAPSORT),对白点生成一个小根堆!-1 Description of the problem based on the distribution of plane n-n-white spots and black spots, each point with a pair of coordinates (x, y) said. A black point b = (xb, yb) dominating a white point w = ( xw, yw) if and only if xb> = xw and yb> = yw. If the black point b dominant white w, then the black point and white point w b can match (which can form a matched pair). in a black spot at most can only be matched with a white spot, a white point can only match with the premise of a black point, find the n-n-white spots and black spots on the maximum number of matches. 2, specific requirements requirements: time efficiency in the O ( NlgN) 3, Implementation of the greedy algorithm based on x coordinates in ascending order of black spots (available QUICKSORT or HEAPSORT), generating a small white spot root heap!
Platform: |
Size: 375808 |
Author: zaclina |
Hits:
Description: Insertion sort is a simple sorting algorithm: a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort
Platform: |
Size: 1024 |
Author: irisrd |
Hits:
Description: 堆积排序(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.
Platform: |
Size: 1024 |
Author: mfeng |
Hits:
Description: sorting programs - bubble, heapsort, insertion and merge sort-sorting programs - bubble, heapsort, insertion and merge sort
Platform: |
Size: 2048 |
Author: saurav |
Hits:
Description: Heap sort algorithm in java :)
Platform: |
Size: 1024 |
Author: Sahar |
Hits:
Description: add element and sort by heapsort
Platform: |
Size: 1024 |
Author: batool |
Hits:
Description: 堆排序，使用堆排序的方法对指针L所指向的结构体中的成员 — 数组Key 中的数据进行排序。成功时，返回1，否则返回0-Heap sort, using the method of heap sort pointer L points to the members of the structure- the array to sort the data in the Key. Success, returns 1, otherwise 0
Platform: |
Size: 153600 |
Author: jassy |
Hits:
Description: 堆排序树控件显示效果，用MFC实现。输入一串字符在nlog2n时间之类排序-Heap sort tree control display
Platform: |
Size: 24731648 |
Author: 李俊 |
Hits:
Description: 堆排序树控件显示效果，用MFC实现。输入一串字符在nlog2n时间之类排序-Heap sort tree control display
Platform: |
Size: 23343104 |
Author: 李俊 |
Hits:
Description: 经典的数据结构算法实现，堆排序里的C实现，源码请下载-Classical data structure algorithms, heap sort in the C implementation, source code download
Platform: |
Size: 1024 |
Author: 杨阳 |
Hits:
Description: Sorting algorithms: Heapsort, Mergesort and Quicksort.
Platform: |
Size: 2048 |
Author: Gilipter |
Hits: