Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - SelectSort

Search list

[CSharp] PX

Description: oid Reset() //重置\"次数\", 即比较与移动的效率统计 int BubbleSort(int length, int ls[]) //冒泡排序 int InsertSort(int length, int ls[]) //插入排序 int SelectSort(int length, int ls[]) //选择排序 int QuickSort(int length, int ls[]) //快速排序 int ShellSort(int length, int ls[]) //希尔排序 -oid Reset () / / replace "frequency", that compared with the efficiency of mobile statistics int BubbleSort (int length, int ls []) / / int Bubble Sort InsertSort (int length, int ls []) / / Sort int SelectSort insert (int length, int ls []) / / int QuickSort SELECTION SORT (int length, int ls []) / / int Quick Sort ShellSort (int length, int ls []) / / Sort Hi
Platform: | Size: 1122 | Author: Hy | Hits:

[Mathimatics-Numerical algorithms] selectsort

Description: 《计算机算法基础》关于选择问题算法：找第k小元素，时间复杂度为O（n）；-"computer algorithm based" on the choice of algorithm : k find small elements, time complexity of O (n);
Platform: | Size: 800 | Author: 郑章孝 | Hits:

[Windows Develop] dwqdsort111

Description: 1）实现以下常用的内部排序算法并对它们的时间效率进行比较： 必做（6种）：起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序； 选做：折半插入、二路归并、基数排序等等； 2）函数首部要求：void XXXXSort(char **list, int len, int n, int *c, int *s) 其中： a) XXXXSort为排序函数名，具体如下： 起泡排序BubbleSort 直接插入排序InsertSort 简单选择排序SelectSort 快速排序QuickSort 希尔排序ShellSort 堆排序HeapSort 折半插入BInsertSort 二路归并Merge2Sort 基数排序RadixSort b) list为二维字符数组的头指针，该二维数组的规格为：char list[n][len] 每行用于存放一个字符串（最大长度为len-1），共n行； c) c用于返回关键字比较次数； d) s用于返回移动次数； 3）要求把各种排序函数做成函数库（文件名统一为：sort.c），用统一提供的主程序进行调用和测评。 -a) achieve the following commonly used internal sorting algorithm as well as their time efficiency comparison : regimen (6) : bubble sort, direct insertion sequence and simple choice sorting, quick sort, Hill, ranked Heap Sort; elected to do : half of insertion, two-way merge. Sort base, and so on; 2) function first requirement : void XXXXSort (char ** list, int len, int n, int * c, int * s) which : a) XXXXSort sort of a function name, as follows : bubble sort BubbleSort direct insertion sort InsertSort simple choice ranking Sele ctSort Quick Sort QuickSort Hill Sorting ShellSort Heap Sort HeapS ort half insert BInsertSort two-way merge Merge2Sort radix sort Radi xSort b) list for the two-dimensional array of characters in the first indicator, the two-dimensional array specifications : cha
Platform: | Size: 10289 | Author: 战天 | Hits:

[Other resource] coutingsort

Description: 比快速排序更快的排序算法；这个了示例包含多种数据结构的算法，如InsertSort，ShellSort，BubbleSort，SelectSort，BinaryInsertSort，TableInsertSort，QuickSort，CoutingSort。对于每个算法用1万个数据比较排序性能，并且使用精确计时器（精度远远大于ms，到达us）,使用正序，逆序，随机序列进行比较性能分析。
Platform: | Size: 127327 | Author: 人民币 | Hits:

[JSP/Java] Sort

Description: QuickSort,SelectSort用Eclipse实现
Platform: | Size: 3330 | Author: 吕明涛 | Hits:

[JSP/Java] selectSort

Description: Java选择排序法，用来对数组的排序算法
Platform: | Size: 865 | Author: 石磊 | Hits:

[Other resource] selectsort

Description: 选择排序，以及测试程序，类似的还有其他排序，可以进行比较
Platform: | Size: 3973 | Author: 王森 | Hits:

[Other resource] selectsort

Description: 这个是选择排序， 代码正确，拷下来就可以用啦
Platform: | Size: 6644 | Author: snail | Hits:

[Other resource] SelectSort

Description: 常用的数据结构--Java实现的源代码，主要是选择排序算法实现.
Platform: | Size: 2627 | Author: shengang | Hits:

[Mathimatics-Numerical algorithms] selectsort

Description: 《计算机算法基础》关于选择问题算法：找第k小元素，时间复杂度为O（n）；-"computer algorithm based" on the choice of algorithm : k find small elements, time complexity of O (n);
Platform: | Size: 1024 | Author: | Hits:

[CSharp] PX

Description: oid Reset() //重置"次数", 即比较与移动的效率统计 int BubbleSort(int length, int ls[]) //冒泡排序 int InsertSort(int length, int ls[]) //插入排序 int SelectSort(int length, int ls[]) //选择排序 int QuickSort(int length, int ls[]) //快速排序 int ShellSort(int length, int ls[]) //希尔排序 -oid Reset ()// replace "frequency", that compared with the efficiency of mobile statistics int BubbleSort (int length, int ls [])// int Bubble Sort InsertSort (int length, int ls [])// Sort int SelectSort insert (int length, int ls [])// int QuickSort SELECTION SORT (int length, int ls [])// int Quick Sort ShellSort (int length, int ls [])// Sort Hi
Platform: | Size: 1024 | Author: Hy | Hits:

[Windows Develop] dwqdsort111

Description: 1）实现以下常用的内部排序算法并对它们的时间效率进行比较： 必做（6种）：起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序； 选做：折半插入、二路归并、基数排序等等； 2）函数首部要求：void XXXXSort(char **list, int len, int n, int *c, int *s) 其中： a) XXXXSort为排序函数名，具体如下： 起泡排序BubbleSort 直接插入排序InsertSort 简单选择排序SelectSort 快速排序QuickSort 希尔排序ShellSort 堆排序HeapSort 折半插入BInsertSort 二路归并Merge2Sort 基数排序RadixSort b) list为二维字符数组的头指针，该二维数组的规格为：char list[n][len] 每行用于存放一个字符串（最大长度为len-1），共n行； c) c用于返回关键字比较次数； d) s用于返回移动次数； 3）要求把各种排序函数做成函数库（文件名统一为：sort.c），用统一提供的主程序进行调用和测评。 -a) achieve the following commonly used internal sorting algorithm as well as their time efficiency comparison : regimen (6) : bubble sort, direct insertion sequence and simple choice sorting, quick sort, Hill, ranked Heap Sort; elected to do : half of insertion, two-way merge. Sort base, and so on; 2) function first requirement : void XXXXSort (char** list, int len, int n, int* c, int* s) which : a) XXXXSort sort of a function name, as follows : bubble sort BubbleSort direct insertion sort InsertSort simple choice ranking Sele ctSort Quick Sort QuickSort Hill Sorting ShellSort Heap Sort HeapS ort half insert BInsertSort two-way merge Merge2Sort radix sort Radi xSort b) list for the two-dimensional array of characters in the first indicator, the two-dimensional array specifications : cha
Platform: | Size: 10240 | Author: 战天 | Hits:

[Data structs] coutingsort

Description: 比快速排序更快的排序算法；这个了示例包含多种数据结构的算法，如InsertSort，ShellSort，BubbleSort，SelectSort，BinaryInsertSort，TableInsertSort，QuickSort，CoutingSort。对于每个算法用1万个数据比较排序性能，并且使用精确计时器（精度远远大于ms，到达us）,使用正序，逆序，随机序列进行比较性能分析。-Faster than the Quicksort sorting algorithm that the sample contains a variety of data structure algorithms, such as InsertSort, ShellSort, BubbleSort, SelectSort, BinaryInsertSort, TableInsertSort, QuickSort, CoutingSort. For each algorithm using 10,000 data sorting performance, and the use of precision timer (accuracy is much larger than ms, to reach us), the use of positive sequence, reverse, random sequence comparison of performance analysis.
Platform: | Size: 126976 | Author: 人民币 | Hits:

[JSP/Java] Sort

Description: QuickSort,SelectSort用Eclipse实现-QuickSort, SelectSort realize with Eclipse
Platform: | Size: 3072 | Author: 吕明涛 | Hits:

[JSP/Java] selectSort

Description: Java选择排序法，用来对数组的排序算法-Java Select sort method, used to array sorting algorithm
Platform: | Size: 1024 | Author: 石磊 | Hits:

[Data structs] selectsort

Description: 选择排序，以及测试程序，类似的还有其他排序，可以进行比较-Choice of sequencing, and testing procedures, there are other sort of similar, you can compare
Platform: | Size: 4096 | Author: 王森 | Hits:

[Other Embeded program] selectsort

Description: 这个是选择排序， 代码正确，拷下来就可以用啦-This is the choice of sequencing, the code correctly, you can copy down useless
Platform: | Size: 878592 | Author: snail | Hits:

[Data structs] SelectSort

Description: 常用的数据结构--Java实现的源代码，主要是选择排序算法实现.-Commonly used data structure- Java source code to achieve the main sorting algorithm is to choose to achieve.
Platform: | Size: 2048 | Author: shengang | Hits:

[Mathimatics-Numerical algorithms] selectsort

Description: c++写的快速排序算法，从命令行输入数组，调用算法后返回结果。-c++ write quick sort algorithm, input from the command line array after the call to return to the results of algorithm.
Platform: | Size: 12288 | Author: 佚名 | Hits:

[Other] selectsort

Description: 算法设计中的选择排序问题，调试通过,VC++中编写-select sort vc++
Platform: | Size: 1024 | Author: wang | Hits:
« 12 3 »

CodeBus www.codebus.net