Search - sort - CodeBus

Search - sort - List

[Documents] 插入排序(Inseretion Sort).zip DL : 0: Date : 2026-01-14 Size : 3.13kb User :
[Documents] 堆排序 DL : 0: c语言排序-c language sort
Date : 2026-01-14 Size : 1kb User : daimi
[Documents] 快速排序 DL : 0: c语言排序-c language sort
Date : 2026-01-14 Size : 1kb User : daimi
[Documents] 冒泡排序 DL : 0: c语言排序-c language sort
Date : 2026-01-14 Size : 1kb User : daimi
[Documents] 希尔排序 DL : 0: c语言排序-c language sort
Date : 2026-01-14 Size : 1kb User : daimi
[Documents] 选择排序 DL : 0: c语言排序-c language sort
Date : 2026-01-14 Size : 0byte User : daimi
[Documents] 标准库中的排序算法 DL : 0: 标准库中的排序算法-standards for the Sort Algorithm
Date : 2026-01-14 Size : 15kb User : 张一
[Documents] 插入排序(Inseretion Sort) DL : 0: 插入算法，英文叫作insertion sort-insertion algorithm, called the insertion sort English
Date : 2026-01-14 Size : 3kb User : 陈士
[Documents] neibu DL : 0: 内部排序的实验报告和代码-sort of internal reports and experimental code
Date : 2026-01-14 Size : 67kb User : 张立
[Documents] 利用双向走动法改进冒泡排序算法C语言源代码 DL : 0: 传统的冒泡排序法是这样操作：从前往后，依次比较两个相邻的元素，如果逆序则交换这两个元素值，然后继续往后操作；到了数据尾部时，就找出了一个最大值（或最小值）。然后重复上面的操作n-1次（n为元素个数）。相关的改进办法：按照上面的办法来操作的话，第一次扫描把最大数（或最小数）放到最后面的位置，第二次扫描时其实只需要扫描到倒数第二个位置就可以了，因为最后一个位置已经不需要判断了，以后的操作都是类似的。这样可以减小程序运行时间。-traditional Bubble Sort method is operated : former next, followed by two more adjacent elements, if Roget will exchange value of the two elements, and then continue later operation; The tail of the data, it found a maximum (or minimum). Then repeat the operation of the above n-1 (n is the number of elements). The improvements : In accordance with the above approach to the operation of the first scanning the maximum (or minimum number) onto the surface of the final location of the second scan in fact only need to scan the penultimate position can be, a place for the final judgment has not come to the end of operation are similar. Such procedures can reduce the run time.
Date : 2026-01-14 Size : 4kb User : 张庚
[Documents] bidir_insertion_sort DL : 0: 二路插入排序：可将输入的一组数据按二路插入排序。操作简便，易于实现其功能。-two-sample insertion sort : can be imported by a two-sample data insertion order. Simple, easy to implement its functions.
Date : 2026-01-14 Size : 3kb User : jhm
[Documents] Fast_sort DL : 0: 快速排序：用最简单的方法实现快速排序。易于操作。-quick sort : the simplest way to achieve rapid sequencing. Easy to operate.
Date : 2026-01-14 Size : 3kb User : jhm
[Documents] searchandorder DL : 0: 属于利用C++开发的数据结构代码，包括顺序链表的折半查找等多种查找方法和冒泡排序等多种排序方法。-belonging to the development of the use of C code data structure, including sequence Chain binary search various search methods and bubble sort, and other ranking methods.
Date : 2026-01-14 Size : 288kb User : 张婧姝
[Documents] AllAboutGPS DL : 0: 我自己整理的有关GPS发展的英文资料库i@@@给大家共享一下啊！！欢迎下载-I sort of the development of English GPS database i @ @ @ to share what ah! ! Welcome to download
Date : 2026-01-14 Size : 147kb User : wanglin
[Documents] bubble DL : 0: 双向冒泡排序，加符号标志位！大大减少了排序时间。-Bidirectional Bubble Sort, plus symbols flag! Greatly reduces the sorting time.
Date : 2026-01-14 Size : 1kb User : 杨文超
[Documents] insertion DL : 0: implementation of insertion sort algorithm and its computational cost. it is testing on arrays of lenghts differents
Date : 2026-01-14 Size : 1kb User : Joan Talles
[Documents] sort DL : 0: 一、课题名称：排序算法的比较二、基本要求： 1.任意性：系统首先生成1000个随机整数，然后分别用不同的排序方法对其进行升序排序，给出每种方法的比较次数或所用时间 2.友好性：界面要友好，输入有提示，尽量展示人性化 3.可读性：源程序代码清晰、有层次 4.健壮性：用户输入非法数据时，系统要及时给出警告信息三、课程总结四、源码-First, the subject title: Comparison of sorting algorithm II, the basic requirements: 1. Arbitrary: System first generation of 1000 random integer, and then were treated with different methods to sort them in ascending order, given the number of each method of comparison or Time 2. friendliness: friendly interface to the importation of tips, as far as possible to display user-friendly 3. readability: source code clear, there is the level of 4. robustness: illegal data entered by the user, the system should be promptly given a warning message Third, summing up the four courses, source
Date : 2026-01-14 Size : 152kb User : 稻草人
[Documents] sort DL : 0: 实现排序的源程序，包括两种方法，冒泡排序和快速排序-bubble sort and quick sort
Date : 2026-01-14 Size : 10kb User : 夏怡
[Documents] SORT DL : 0: 对给定随机数进行排序，输出排序前后的随机数-Random number given to sort sort the output before and after the random number
Date : 2026-01-14 Size : 3kb User : 赵珍珠
[Documents] sort DL : 0: 用选择法对数组中10个整数按由小到大排序-10 integer array in ascending sort of choice of law
Date : 2026-01-14 Size : 3kb User : hao

« 12 3 »