Search - sort - CodeBus

Search - sort - List

[MiddleWare] Demo_Sort DL : 0: 一个排序用的C++函数模板,本模板实现了浮点、整形、字符型的降序排列。-Of a sort used in C++ Function template, the template to achieve a floating-point, plastic, in descending order of the character.
Date : 2026-01-15 Size : 2.15mb User : mms
[MiddleWare] a DL : 0: 快速排序法 //基本的思想:通过一趟排序将待排的记录分割成独立的两部分， //其中前一部分的记录的关键字均比另一部分记录的关键字小， //再分别对两组记录进行递归分割，达到排序的目的 //平均时间复杂度为 O(log2(n-Quick sort method// basic thinking: a trip to sort through rows of records will be separated into two independent parts,// which part of the record before the keyword than another part of the record keyword small,// and then separately two sets of records recursive partitioning, to sort the purpose of// average time complexity is O (log2 (n
Date : 2026-01-15 Size : 1kb User : 宇亮
[MiddleWare] MessageBook DL : 0: 一个通讯录的小程序，实现输入，查询，修改，删除，保存，排序等简单功能-A list of small procedures, input, query, modify, delete, save, sort, such as a simple function
Date : 2026-01-15 Size : 6kb User : 陈泽焘
[MiddleWare] jsgt DL : 0: 一个javascript控件支持排序\翻页功能.-Controls support a javascript function to sort page.
Date : 2026-01-15 Size : 43kb User : 刘斌
[MiddleWare] quickSort DL : 0: 快速排序算法的C语言实现，快速排序是经典的排序算法。-Quick Sort Algorithm C language, is the classic quicksort sorting algorithm.
Date : 2026-01-15 Size : 1kb User : 汪晗
[MiddleWare] sort DL : 0: 用指针实现对输入数组的排序用冒泡法很好用-realise a sort
Date : 2026-01-15 Size : 6kb User : 杨玉丽
[MiddleWare] dan DL : 0: // 堆排序 // 初始调用BuildMaxHeap将a[1..size]变成最大堆 // 因为数组最大元素在a[1]，则可以通过将a[1]与a[size]互换达到正确位置 // 现在新的根元素破坏了最大堆的性质，所以调用MaxHeapify调整， // 使a[1..size-1]成为最大堆，a[1]又是a[1..size-1]中的最大元素， // 将a[1]与a[size-1]互换达到正确位置。 // 反复调用Heapify，使整个数组成从小到大排序。 // 注意：交换只是破坏了以a[1]为根的二叉树最大堆性质，它的左右子二叉树还是具备最大堆性质。 // 这也是为何在BuildMaxHeap时需要遍历size/2到1的结点才能构成最大堆，而这里只需要堆化a[1]即可。-//Heap sort// initial call BuildMaxHeap will become the largest heap a [1 .. size]// the array largest element in a [1], then by a [1] and a [size] interchangeable reach correct position// new root element destroyed maximum heap nature so call MaxHeapify adjusted,// a [1 .. size-1] the maximum heap, a [1] a [1 .. size- The largest element 1],// a [1] with a [size-1] interchangeable achieve the correct position.// Repeatedly call Heapify, so that the entire number of small to large.// Note: The to exchange just destroyed a [1] is the root of the binary tree maximum heap nature, its left and right sub-binary tree or with maximum heap nature.// This is why BuildMaxHeap when you need to traverse the size/2 to 1 node in order to constitute maximum heap, only need to heap of a [1] can be.
Date : 2026-01-15 Size : 1kb User : 李子健
[MiddleWare] sort DL : 0: 各种实用的排序算法：插入排序，二分插入排序，希尔排序，快速排序，两路归并排序-Variety of practical sorting algorithms: insertion sort, binary insertion sort, shell sort, quick sort, two way merge sort ...
Date : 2026-01-15 Size : 2kb User : 秦进
[MiddleWare] DataGridSort DL : 0: 对C#中DataGridSort组件改写为可以排序-DataGridSort component for C#, you can sort rewrite
Date : 2026-01-15 Size : 42kb User : mark