搜索资源列表
Radix-Sort
- 基数排序是一种非比较型整数排序算法,其原理是将整数按位数切割成不同的数字,然后按每个位数分别比较。- Radix sort is a kind of non comparative sorting algorithm, which is based on the number of integers into different numbers, and then according to the number of each.
Bucket-Sort
- 桶排序也叫箱排序。工作的原理是将数组分到有限数量的桶子里,每个桶子再个别排序(有可能再使用别的排序算法或是以递归方式继续使用桶排序进行排序)。- Bucket sort is also called sorting box. Work principle is that the array to a limited number of bucket, each bucket and individual ranking (may use other sorting algorithms
Bubble-Sort
- 冒泡排序是一种极其简单的排序算法,也是我所学的第一个排序算法。它重复地走访过要排序的元素,一次比较相邻两个元素,如果他们的顺序错误就把他们调换过来,直到没有元素再需要交换,排序完成。-Bubble sort is a simple sorting algorithm, sorting algorithm is first learned by me. It repeatedly visited to sort the elements, a comparison of the two adjac
Selection-Sort
- 选择排序也是一种简单直观的排序算法。它的工作原理很容易理解:首先在未排序序列中找到最小(大)元素,存放到排序序列的起始位置;然后,再从剩余未排序元素中继续寻找最小(大)元素,放到已排序序列的末尾。以此类推,直到所有元素均排序完毕。-Selection sort is a simple and intuitive sort algorithm. Its working principle is easy to understand: first in the unsorted sequence t
Insertion-Sort
- 插入排序在实现上,通常采用in-place排序(即只需用到O(1)的额外空间的排序),因而在从后向前扫描过程中,需要反复把已排序元素逐步向后挪位,为最新元素提供插入空间。- Insertion sort in the implementation, is usually used in place sorting (i.e., only need to sort of O (1) extra space). Therefore in the forward scan process a
SORT(CPP-Builder6)
- 排序c++算法 用c++编写,数据结构课程教程使用案例-SORT C++
sort
- 这是一个复杂的排序,最基本的排序方法 。-It is a sort
Sort
- C++实现的任意数据类型的排序算法,使用回调函数的等技巧-C++ sort
sort
- linux中排序的程序,是比较经典的程序了,还不错,-Linux sort of procedures, but also good
sort
- sort pascal code so rt pascal code so rt pascal code so rt pascal code-sort pascal code sort pascal code sort pascal code sort pascal code sort pascal code sort pascal code sort pascal code
sort
- 冒泡排序算法 冒泡排序算法 冒泡排序算法-Bubble Sort Bubble Sort Bubble Sort Bubble Sort Algorithm
PHP-Sort
- php 排序算法源码,Bubble,Insert,Quick,Select,She-php sort code,Bubble,Insert,Quick,Select,Shell
sort
- 基数排序 基数排序(radix sort)属于“分配式排序”(distribution sort),又称“桶子法”(bucket sort)或bin sort,顾名思义,它是透过键值的部份资讯,将要排序的元素分配至某些“桶”中,藉以达到排序的作用,基数排序法是属于稳定性的排序,其时间复杂度为O (nlog(r)m),其中r为所采取的基数,而m为堆数,在某些时候,基数排序法的效率高于其它的稳定性排序法。 快速排序 快速排序由C. A. R. Hoare在1962年提出。它的基本思想是
mpi-merge-sort
- This a MPI merge sort source code -This is a MPI merge sort source code
Data-structure-quick-sort
- 数据结构快速排序的一个小程序示范 数据结构快速排序的一个小程序示范-Data structure quick sort Data structure quick sort Data structure quick sort
quick-sort
- 利用分治法实现一组数据的快速排序,使其排序时间缩短,并采用c语言编程-Using divide and conquer method to achieve quick sort a set of data, the sorting time is shortened, and the use of C language programming
A-topological-sort-of-directed-graph
- 数据结构中的有向图的拓扑排序算法基础程序,可在此基础上进行更改,主要构造了无向图、有向图和逆邻接图,使用c语言编程。-Data structure topological sort algorithm of the directed graph based program that can be changed, on the basis of the main structure undirected graph and directed graph and inverse adjacency
sort
- 各种排序算法,包括选择排序、快速排序、堆排序、基数排序-sort algorithm
bubble-sort-and-display-the-results
- Assembly language bubble sort and display the results
sort
- 任意输入两个大的整数并以Q结尾,然后对输入的数字进行排序,并按从小到大的顺序输出-Enter any two large integers and Q at the end, and then sort of digital inputs, according to the order small to large output