搜索资源列表
data sort 按从大到小的顺序排列
- 由输入对话框输入100个数值，数据放入数组a，其中的整数放入数组b，然后运用选择分类法将数组b中的数据按从大到小的顺序排列，并以每行五个数据在窗体上输出。-100 from the input dialog box to enter values into the data array a, where the integer into the array b, then select the classification using the data in the array b by
ArraySort
- 数组排序，含bubble,quick,insertion,selection四种方法-Array sort,it includes four sort methods as follows: bubble sort ,quick sort,insertion sort and selection sort.
shellsort
- 字符串数组排序-Char array sort
sort
- 先设定随机数发生公式的种子值，根据这个产生一个随机的数组，然后通过插入排序进行排序，并计算运行时间-First occurrence of the formula set random number seed value, the basis of this result in a random array, and then sort through the insertion sort, and calculate the running time
QuickSort
- 用c++写的快速排序算法，从命令行输入数组，调用算法后，返回排序后的数组-With c++ Write quick sort algorithm, from the command line enter the array, called algorithms, return the array after sorting
sort
- 将数组分为小块进行插入排序，然后用合并排序的方法将分块的数组进行排序。-The array is divided into small pieces for insertion sort, and then use the combined approach will be to sort the array sort block.
Sort
- The running time of quicksort can be improved in practice by taking advantage of the fast running time of insertion sort when its input is “nearly” sorted. When quicksort is called on a subarray with fewer than k elements, let it simply return wi
sort
- 产生十个随机数并组成数组，然后进行快速排序和归并排序-Generate 10 random numbers and form an array, and then a quick sort and merge sort
Sort
- 使用模板实现2种数据类型的6种排序，用户可以输入要排序数组的大小。-Using a template to achieve two kinds of data types, six kinds of sorting, the user can enter the size of the array to be sorted.
perm1
- 此程序完成对给出的数组使用递归法进行全排序。-To complete this process using the recursive method given wide array sort.
px
- 利用希尔排序方法排序数组的范例，课上学习时候老师给的 需要的可以拿去-Sort array sort method using Hill s example, to learn lessons when the teacher needs to be Naqu
sort
- 使用简单数组实现各种排序算法，并进行比较。 排序算法： 1、插入排序 2、希尔排序 3、冒泡排序 4、快速排序 5、简单选择排序 6、堆排序 7、归并排序 -Using a simple array to achieve a variety of sorting algorithms, and compared.Sorting algorithm:1, insertion sort2, Hill sort3, bubble sort4, Quick Sort5
sort
- 使用简单数组实现下面各种排序算法，并进行比较。 排序算法： 1、插入排序 2、希尔排序 3、冒泡排序 4、快速排序 5、简单选择排序 6、堆排序（选作） 7、归并排序（选作） 8、基数排序（选作） 9、其他 -Using a simple array to achieve the following various sorting algorithms, and compared. Sorting algorithm: 1, 2, inse
Sort
- 插入排序：将未排序的数插入已排好序的数组中 合并排序：将排好序的数组合并到一起-insert order：make a non-order num be inserted into an ordered array merge order:
array
- 完成数组排序的cpp源代码，可以完成数组增加，删除，修改，排序等功能的代码-Complete source code cpp sort the array, the array can be done to add, delete, modify, sort code etc.
Sort
- 对数组R中的记录R[1..n]按递增序进行插入排序-Records in the array R R [1 .. n] into the sorted in increasing order to
Heap-sort
- 堆积排序(Heapsort)是指利用堆积树（堆）这种资料结构所设计的一种排序算法，可以利用数组的特点快速定位指定索引的元素。 -Heap sort (Heapsort) is the use of stacked tree (heap) data structure designed such a sorting algorithm can take advantage of the characteristics of the array elements quickly locate t
sort
- 数组排序,VC++排序,C语言排序,2个for-sort in array, sort
Array-sort
- 简单数组排序案例 适用于初学者学习C时参考，语言比较规范，是学习格式的好范例-Sorting an array for a simple case of reference for beginners to learn C language fairly standard, is a good example to learn format
dynamic-array-distribution
- 在c++中利用类模板建立动态数组，实现数组的排序，插入，删除-In c++,use a dynamic array class template, realize the array sort, insert, and delete