搜索资源列表
Sort
- 1. 实现插入排序; 2. 实现归并排序; 3. 实现堆排序,包括建堆过程;(三种排序在一个程序中实现) -1. Realize Insertion Sort 2. Merging Sort realize 3. HEAPSORT realize, including the reactor building process (three in one program to sort realize)
set
- 对线段进行堆排序的算法,用于几何运算,可实现对端点进行进一步排序的双重排序功能,可用于线段运算-Carried out on the line segment HEAPSORT algorithms for geometric computing can be realized-to-end double further Sort sort function, can be used for computing segment
duipai
- 用c++编写的堆排序 程序简单易懂,适合初学者-With c++ Prepared HEAPSORT procedures simple, suitable for beginners
sushe2
- 宿舍管理查询软件(**) 任务:为宿舍管理人员编写一个宿舍管理查询软件, 程序设计要求: (1)采用交互工作方式 (2)可以增加、删除、修改信息 (3)建立数据文件 ,数据文件按关键字(姓名、学号、房号)进行排序(选择、快速排序、堆排序等任选一种) (4) 查询 : a.按姓名查询 b.按学号查询 c按房号查询 (5) 打印任一查询结果(可以连续操作)-Dormitory management inquiries
sortCompare
- 各种排序算法BubbleSort、DichotomySort、HeapSort、InsertSort、MergeSort、QuickSort、ShellSort、-Various sorting algorithm BubbleSort, DichotomySort, HeapSort, InsertSort, MergeSort, QuickSort, ShellSort,
heappaixu
- 实现数据结构的堆排序,并且有堆排序的性能分析-Data structure HEAPSORT, and Performance Analysis HEAPSORT
paixu
- (1)对以下6种常用的内部排序算法进行比较:起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序。 (2)待排序表的表长不小于100;其中的数据要用伪随机数产生程序产生;至少要用5组不同的输入数据作比较;比较的指标为有关键字参加的比较次数和关键字的移动次数(关键字交换计为3次移动)。 (3)最后要对结果作出简单分析,包括对各组数据得出结果波动大小的解释。 -(1) of the following six kin
Y_TFun_Tournament
- 二叉树,堆排序模板,时间复杂度:为O(N*Log2(N))。空间复杂度: 2*N-1(个结点)-Binary Tree, HEAPSORT templates, time complexity: In order to O (N* Log2 (N)). Space complexity: 2* N-1 (nodes)
duidejianliheshaixuan
- 堆的建立和筛选 实现堆排序 数据结构初学者可以参考 -Heap realize the establishment and screening data structure HEAPSORT beginners can refer to
duipaixu
- 通过建立大顶堆 建立堆排序 以从小到大的顺序输出结果-Through the establishment of the establishment of Dading heap HEAPSORT to the order from small to large output
sort
- 这是一个用堆排序实现的排序算法,可以通过阅读代码学习堆排序的思想-This is a used HEAPSORT realize the sorting algorithm, you can learn by reading the code thinking HEAPSORT
5_sort
- 各种排序算法例程:简单选择排序;堆排序;插入排序;希尔排序;冒泡排序;快速排序;-Various sorting algorithm routines: Simple Selection Sort HEAPSORT Insertion Sort Hill sort Bubble Sort quick sort
Keyframe
- 从视频中提取关键帧,采用贪心算法和堆排序来处理视频中的大量帧信息。-Extracted from the video key fr a me, the use of greedy algorithm and HEAPSORT to deal with a large number of fr a mes of video information.
sort
- 通过一组相同的数据,对六种不同排序方法(冒泡排序、快速排序、直接插入排序、希尔排序、简单选择排序、堆排序、二路归并排序)的数据元素的比较和移动的次数做一个比较,并对结果作出简单分析-Through a group of the same data, sort of six different methods (bubble sort, quick sort, direct insertion sort, Hill sort, simpl
DivConquer
- 算法实验:1 分治法在数值问题中的应用 ——最近点对问题 2 减治法在组合问题中的应用——8枚硬币问题 3 变治法在排序问题中的应用——堆排序 4 动态规划法在图问题中的应用——全源最短路径问题 -Algorithm experiment: 1 divided numerical problems in the application- the nearest point to question 2 by govern
paixu
- 2008软件公司面试题:排序大全:简单选择排序、冒泡排序、选择排序、shell排序、快速排序、插入排序、堆排序(从小到大)、归并排序(利用递归)-2008 software companies face questions: Sort Guinness: simple choice to sort, bubble sort, select sort, shell sort, quick sort, insert sort HEAPSOR
5428934
- 排序算法平均时间的比较,实现几种排序算法(selectionsort, insertionsort,bottomupsort,quicksort, 堆排序)-The average amount of time sorting algorithm of comparison, the realization of several sorting algorithm (selectionsort, insertionsort, botto
ccs
- 弗洛伊德算法,堆排序的时间,主要由建立初始堆和反复重建堆这两部分的时间开销构成,它们均是通过调用Heapify实现的。 -Floyd algorithm, HEAPSORT time, mainly by the establishment of the initial stack and heap repeatedly reconstruction spending time in these two parts of comp
arragement
- 数据结构涉及到的所有排序算法,如基数排序,堆排序等-Data structures involved in all the sorting algorithm, such as base sequencing, etc. HEAPSORT
duipaixusuccess
- 实现了一种堆排序算法,堆排序利用了大根堆堆顶记录的关键字最大(或最小)这一特征,使得在当前无序区中选取最大(或最小)关键字的记录变得简单-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 c