搜索资源列表
merge
- 在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。 编程任务：对于给定n堆石子,编程计算合并成一堆的最小得分和最大得分。-Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pi
Cpp1
- heap sort from one of my howeworks
uBinaryHeap
- Binary Heap Generics Implementation
binary-heap
- binary heap data structures
Arranging
- 各种排序算法：多种数据类型的冒泡排序；快排；希尔排序；堆排序；结构排序；结构排序；硬盘文件排序等-A variety of sorting algorithms: bubble sort a variety of data types fast rearrangement Hill sort heap sort structure, sort structure, sort hard to sort the files, etc.
WINSORT
- Various types of sortings and their comparison (Bubble, Quick, Bit, Heap, Shell).
matrix
- multiplication of matrix by heap array
sort
- C++_排序(冒泡，选择，快速，归并，插入，折半插入，希尔，堆排序)-C++ _ sort (bubble, selection, quick, merge, insertion, binary insertion, Hill, heap sort)
HeapSort(1)
- Heap Sort algorithm running on an array to sort its values
Heap_Sort
- heap sort problem-heap sort problem ....
BestFirstSearch_HeapAlgo
- 1. 此程式執行將從路徑讀取一個文字檔 ( 路徑：C:INPUT.TXT ) 2. 執行結束會產生一個排序後的文字檔 ( 路徑：C:OUTPUT.TXT ) 3. 給定的初始盤面一定有解 本程式採用的演算法策略為Best-first search with branch-and-bound algorithm 1. 使用Max heap 實作Priority queue 2. 使用bound function 估計目前盤面走至答案最少需要幾步 第一部分 所謂 h
heap_sort
- heap sort is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure tha
insertion
- is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure that the sort
sort
- 用JAVA语言实现的一些排序算法。包括冒泡排序、桶排序、基数排序、堆排序、插入排序、归并排序、快速排序、计数排序、选择排序。-JAVA language using some sorting algorithm. Including bubble sort, bucket sort, radix sort, heap sort, insertion sort, merge sort, quick sort, counting sort, selection sort.
10000!
- 计算N的阶层(大数算法)，如果在堆中申请，可计算到更大-Calculate N, class (large number algorithm), if the application heap, calculated to a greater
stone
- 在一个圆形操场的四周摆放N堆石子(N≤100)，现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆合并成新的一堆，并将新的一堆的石子数，记为该次合并的得分。编一程序，读入堆数N及每堆石子数(≤100)选择一种合并石子的方案，分别得到合并这N堆石子为一堆，可以得到的最大得分和最小得分 输入包含多个例子。第一行为N，即石子堆的数目，以下一行为N个整形，分别代表每堆石子的数目。当N=0时，输入结束。 -Around the playground in a circular heap
Heap-Sort
- C++ implementation of Heap Sort
classic-sorting-algorithm
- 给出了常见的八种经典排序算法： 1.希尔排序 2.二分插入法 3.直接插入法 4.带哨兵的直接排序法 5.冒泡排序 6.选择排序 7.快速排序 8.堆排序 -Common eight classic sorting algorithms: Hill sorting. Insertion method. Direct insertion method. 5 Sentinel direct sequencing method. Bubble Sort 6 sele
Heap-Sort-Algorithm-Pseudo-Code
- The heapsort algorithm can be divided into two parts. In the first step, a heap is built out of the data. In the second step, a sorted array is created by repeatedly removing the largest element from the heap, and inserting it into the arra
Dijkstra using Fibonacci Heap
- This program shows implemenation of Dijkstra's algorithm using Fibonacci heap. Which has the best running time