Location:
Search - BIN SORT
Search list
Description: 排序算法、字典和B-树的C++语言实现
代码内容 包括以下算法：
qui.c sort: quicksort
qsort.c sort: qsort
ins.c sort: insert sort
shl.c sort: shell sort
has.c dictionary: hash tables
bin.c dictionary: binary tree
rbt.c dictionary: red-black trees
skl.c dictionary: skip lists
ext.c external sort
btr.c btree
语言 C++
编译平台 Visual C++
作者 Thomas Niemann
备注 来自Sorting and Searching Algorithms:A Cookbook-algorithm, dictionaries and B-Tree C language code include the following algorithm : qui.c sort : quicksort qsort.c sort : qsort ins.c sort : insert sort shl.c sort : shell sort has.c dictionary : hash tables bin.c dictionary : binary tree rbt.c dictionary : red-black trees skl.c dictionary : skip lists ext.c external sort btr.c BTREE Part C language Visual C platform translated author Thomas Niemann Remarks from the Sorting and S earching Algorithms : A Cookbook
Platform: |
Size: 24943 |
Author: 罗鹏魁 |
Hits:
Description: This a A* pathfinding example to illustrate how to implement a A* pathfinding algorithm into your program. It s a port from Patrick Lesters example in BlitzBasic to VB.Net. It uses a Binary Heap class I made to sort the score values. -A * pathfinding example to illustr ate how to implement a A * pathfinding algorithm into your program. It's a port from Patrick Leste rs example in BlitzBasic to VB.NET. It uses a Bin Indigenous Heap class I made to sort the score values.
Platform: |
Size: 12639 |
Author: tongtong |
Hits:
Description: 排序算法、字典和B-树的C++语言实现
代码内容 包括以下算法：
qui.c sort: quicksort
qsort.c sort: qsort
ins.c sort: insert sort
shl.c sort: shell sort
has.c dictionary: hash tables
bin.c dictionary: binary tree
rbt.c dictionary: red-black trees
skl.c dictionary: skip lists
ext.c external sort
btr.c btree
语言 C++
编译平台 Visual C++
作者 Thomas Niemann
备注 来自Sorting and Searching Algorithms:A Cookbook-algorithm, dictionaries and B-Tree C language code include the following algorithm : qui.c sort : quicksort qsort.c sort : qsort ins.c sort : insert sort shl.c sort : shell sort has.c dictionary : hash tables bin.c dictionary : binary tree rbt.c dictionary : red-black trees skl.c dictionary : skip lists ext.c external sort btr.c BTREE Part C language Visual C platform translated author Thomas Niemann Remarks from the Sorting and S earching Algorithms : A Cookbook
Platform: |
Size: 24576 |
Author: 罗鹏魁 |
Hits:
Description: This a A* pathfinding example to illustrate how to implement a A* pathfinding algorithm into your program. It s a port from Patrick Lesters example in BlitzBasic to VB.Net. It uses a Binary Heap class I made to sort the score values. -A* pathfinding example to illustr ate how to implement a A* pathfinding algorithm into your program. It's a port from Patrick Leste rs example in BlitzBasic to VB.NET. It uses a Bin Indigenous Heap class I made to sort the score values.
Platform: |
Size: 12288 |
Author: tongtong |
Hits:
Description: JAVA上使用的程序源码，拥有很好的功能，可以很轻松的操作-JAVA on the procedures used source, with very good features, it is easy to operate
Platform: |
Size: 40960 |
Author: 孙伟 |
Hits:
Description: 初始链表的内容为：3562，6381，0356，2850，9136，3715，8329，7481，写出用基数排序法对它们进行排序的过程，并编程实现。-The initial list read as follows: 3562,6381,0356,2850,9136,3715,8329,7481, write them using radix sort method to sort the process, and programming.
Platform: |
Size: 1024 |
Author: 车亚暖 |
Hits:
Description: 基数排序(radix sort）则是属于“分配式排序”（distribution sort），基数排序法又称“桶子法”（bucket sort）或bin sort，顾名思义，它是透过键值的部份资讯，将要排序的元素分配至某些“桶”中，藉以达到排序的作用，基数排序法是属于稳定性的排序，其时间复杂度为O (nlog(r)m)，其中r为所采取的基数，而m为堆数，在某些时候，基数排序法的效率高于其它的比较性排序法。
-Radix sort (radix sort) is a " distributive sort" (distribution sort), radix sorting method known as " bucket method" (bucket sort) or bin sort, the name suggests, it is a key part of the information through, elements to be assigned to some sort of " bucket" in order to achieve the sort of role in the stability of radix sort is the sorting method is its time complexity is O (nlog (r) m), where r is the base taken , and m is the number of reactors, at some point, radix sorting method is more efficient than other comparable sort.
Platform: |
Size: 1024 |
Author: mfeng |
Hits:
Description: Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a distribution sort, and is a cousin of radix sort in the most to least significant digit flavour. Bucket sort is a generalization of pigeonhole sort. Since bucket sort is not a comparison sort, the O(n log n) lower bound is inapplicable. The computational complexity estimates involve the number of buckets.
Platform: |
Size: 11264 |
Author: Sergiu911 |
Hits:
Description: 基数排序的串行程序，基数排序法又称“桶子法”（bucket sort）或bin sort，顾名思义，它是透过键值的部份资讯，将要排序的元素分配至某些“桶”中，藉以达到排序的作用，基数排序法是属于稳定性的排序，其时间复杂度为O (nlog(r)m)，其中r为所采取的基数，而m为堆数，在某些时候，基数排序法的效率高于其它的稳定性排序法。-Radix sort of serial program, radix sorting method known as " bucket method" (bucket sort) or bin sort, as the name suggests, it is through some of the key information, and will want to sort the elements assigned to some of the " barrel" in , in order to achieve the sort of role, radix sort method belongs to the stability of the sort, its time complexity is O (nlog (r) m), where r is taken to the base, and m is the number of the heap, at some point, radix sort efficiency than other sort of stability.
Platform: |
Size: 2048 |
Author: zhang |
Hits:
Description: C语言快速排序程序 郝彬C语言学习的视频的学习对应源程序-C quick sort program Hao Bin video learning C language learning, the corresponding source program
Platform: |
Size: 1024 |
Author: 郭琨 |
Hits:
Description: 基数排序
基数排序（radix sort）属于“分配式排序”（distribution sort），又称“桶子法”（bucket sort）或bin sort，顾名思义，它是透过键值的部份资讯，将要排序的元素分配至某些“桶”中，藉以达到排序的作用，基数排序法是属于稳定性的排序，其时间复杂度为O (nlog(r)m)，其中r为所采取的基数，而m为堆数，在某些时候，基数排序法的效率高于其它的稳定性排序法。
快速排序
快速排序由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。
堆排序
堆排序(Heapsort)是指利用堆积树（堆）这种数据结构所设计的一种排序算法，它是选择排序的一种。可以利用数组的特点快速定位指定索引的元素。堆分为大根堆和小根堆，是完全二叉树。大根堆的要求是每个节点的值都不大于其父节点的值，即A[PARENT[i]] >= A[i]。在数组的非降序排序中，需要使用的就是大根堆，因为根据大根堆的要求可知，最大的值一定在堆顶。
求幂
输入xy 求y的x次方的值-Radix sort
Element assignment radix sort (radix sort) are assigned ordering (distribution sort), also known as bucket Law (bucket sort) or bin sort, as the name suggests, it is part of the information through the key will be sorted to some of the barrel in order to achieve the sort of role, radix sort belongs to the sort of stability, its time complexity is O (nlog (r) m), where r is taken to the base, and m is the heap number, at some point, radix sort efficiency than other sort of stability.
Quick Sort
Fast Sorted by C. A. R. Hoare proposed in 1962. Its basic idea is: a trip by ordering the data to be sorted into separate two parts, one part of all of the data than the other portion of all data should be small, then the data in this way for the two parts separately fast sort, the entire sorting process can be recursively in order to achieve the whole data into an ordered sequence.
Heap sort
Heap sort (Heapsort) refers to a sorting algorithm uses stacked tree (h
Platform: |
Size: 3072 |
Author: 贺敏 |
Hits: