Search - sort - CodeBus

Search - sort - List

[Data structs] 5 sort algorithms.txt DL : 0: 5 sort routins: Simple Selection Sort, HEAPSORT Insertion Sort, Hill sort, Bubble Sort, Quick sort
Date : 2012-02-22 Size : 2.84kb User : besoyal@yahoo.gr
[Data structs] 一个通用的排序程序 DL : 1: 此程序还不能对字符串排序，望能予以改进-A general soring program.*It can t sort string, and need to be improved.
Date : 2026-01-15 Size : 0byte User :
[Data structs] 各种排序比较 DL : 0: 分别实现直接插入排序、冒泡排序、简单选择排序、希尔排序、快速排序、堆排序，并随机生成30个数，比较各算法的时、空性能和稳定性。-respectively direct insertion sort, bubble sort, simple choice, in order of ranking Hill, the quick sort, heap sort, and Random Number Generation 30, a comparison algorithm, the performance and stability of the air.
Date : 2026-01-15 Size : 334kb User : 李景良
[Data structs] QUICK SORT DL : 0: 使用VC编写的快速排序算法，运行后输入你希望产生的次数，会随机产生数值，并完成排序，是一个教好理解快速排序算法的程序。-prepared by the use of VC quicksort algorithm, running after you input the desired number of randomly generated digits and completed sequencing, is a good understanding of the fast algorithm procedures.
Date : 2026-01-15 Size : 11kb User : 陶自权
[Data structs] ssort DL : 0: 数据结构中的各种排序算法，包括快速排序，堆排序等。是经过精简的程序-data structure of the various sorting algorithms, including Quick Sort stacked ranking. Yes streamlined procedures
Date : 2026-01-15 Size : 2kb User : 戚玉涛
[Data structs] sort DL : 0: 利用随机函数产生30000个随机整数，利用插入排序、起泡排序、选择排序、快速排序、堆排序、归并排序等排序方法进行排序，并统计每一种排序上机所花费的时间-Using random functions to generate 30,000 random integers, the use of insertion sort, bubbling sort, select sort, quick sort, heap sort, merge sort and other sorting methods to sort and sort each type of statistics on the time machine
Date : 2026-01-15 Size : 4kb User : sufei
[Data structs] sort DL : 1: 这是数据结构的课程设计，对起泡排序、直接排序、简单选择排序、快速排序、希尔排序和堆排序算法进行比较和分析，C语言实现。-This is the data structure of the curriculum design, sort of sparkling, direct sequencing, a simple selection sort, quick sort, Hill sort and heap sort algorithm comparison and analysis, C language.
Date : 2026-01-15 Size : 192kb User : Anse
[Data structs] SORT DL : 0: 常见的多种排序算法：插入排序冒泡排序快速排序希尔排序堆排序 -A variety of common sorting algorithm: Insertion Sort Bubble Sort Quick Sort Hill sort HEAPSORT
Date : 2026-01-15 Size : 1kb User : 少帅
[Data structs] sort DL : 0: 随机产生个整数n=100，200，300，1000，2000个整数并存于数组r[1..n]中。对主要查找算法（顺序查找、插入排序、冒泡排序、堆排序、快速排序）进行实验比较，计算出平均比较次数、平均移动次数及执行时间。由程序自动计算.-Randomly generated integers integers n = 100,200,300,1000,2000 co-exist in the array r [1 .. n] in. On the main search algorithm (the order of search, Insertion Sort, Bubble Sort, Heap Sort, Quick Sort) for the comparison, the calculated average number of comparison, the average mobile number and execution time. Automatically calculated by the procedure.
Date : 2026-01-15 Size : 17kb User : 侯健
[Data structs] Sort DL : 1: 数据结构与算法的排序算法演示,这是我上大学的时候做的实验,里面展示了几种常用的排序算法的算法演示,如插入排序,选择排序,快速排序,堆排序.-Data structure and algorithm of the sorting algorithm demo, this is my time to college to do the experiment, which showed several common sorting algorithm presentation, such as insertion sort, selection sort, quick sort, heap sort.
Date : 2026-01-15 Size : 86kb User : THM
[Data structs] sort DL : 0: 数据结构c语言版中常见的排序的源码，都是c编写的-Data structure c language version of the sort common source, are c prepared
Date : 2026-01-15 Size : 85kb User : hefang
[Data structs] sort DL : 0: 这是关于数据结构书中经常介绍的排序算法的具体实现，包含希尔排序、快速排序、对排序、归并排序、静态链表排序、改进的冒泡算法排序等，并且附有时间统计-This is a book on data structure often described specific sorting algorithm to achieve, including the Hill sort, quick sort, for sorting, merge sort, static ranking list, improved bubble sort algorithm and so on, and with time and Statistics
Date : 2026-01-15 Size : 3kb User : 吴
[Data structs] sort DL : 0: 对快速，选择，冒泡，插入，希尔，堆，基数，位图排序进行比较-Fast, selection, bubble, insert, Hill, sand, the base for comparison sort bitmap
Date : 2026-01-15 Size : 128kb User : cpuno1
[Data structs] sort DL : 0: 排序算法，包含冒泡，快排，插入，2分，等排序算法，可由用户选择排序方法，并由系统随机生成数据，进行排序，并可计算每种排序的所花时间，来比较排序的快慢-Sorting algorithms, including bubble, fast scheduling, insert, 2 points, such as sorting algorithm, can be sorted by the user to choose the system of randomly generated data, sort, and the calculation of each sort of the time spent to compare the sort of speed
Date : 2026-01-15 Size : 127kb User : rbk
[Data structs] sort DL : 0: 用插入排序堆排序归并排序快速排序对1000000个0到2000000的整数进行排序对文件进行划分后排序-Insertion Sort by HEAPSORT Merging Sort Quick Sort of 1,000,000 0-2000000 integer sort of documents classified after the sort
Date : 2026-01-15 Size : 16kb User : 郭
[Data structs] sort DL : 0: spim的冒泡排序，里面是源码，可以实现的-spim of bubble sort，spim is a self-contained simulator that will run MIPS32 assembly language programs. It reads and executes assembly language programs written for this processor. spim also provides a simple debugger and minimal set of operating system services. spim does not execute binary (compiled) programs
Date : 2026-01-15 Size : 1kb User : xxj
[Data structs] bubble-sort DL : 0: 基于for循环的冒泡排序法，第一次上传还要这么麻烦，到二十个字了没-For loop based on bubble sort method, first upload should be so troublesome to twenty words yet
Date : 2026-01-15 Size : 1kb User : warshining
[Data structs] Figure-topological-sort DL : 0: 拓扑排序　对一个有向无环图 G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任意一对顶点u和v，若u，v ∈E，则u在线性序列中出现在v之前。　通常，这样的线性序列称为满足拓扑次序的序列，简称拓扑序列。注意：　 ①若将图中顶点按拓扑次序排成一行，则图中所有的有向边均是从左指向右的。　 ②若图中存在有向环，则不可能使顶点满足拓扑次序。　 ③一个DAG的拓扑序列通常表示某种方案切实可行。 -Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible.
Date : 2026-01-15 Size : 1kb User : 江洋
[Data structs] Counting-sort DL : 0: 计数排序的源代码，大家可参照思考，哎还要上传-Counting sort of the source code
Date : 2026-01-15 Size : 1kb User : david
[Data structs] Bubble sort DL : 0: 冒泡排序（Bubble Sort，台湾译为：泡沫排序或气泡排序）是一种简单的排序算法。它重复地走访过要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。走访数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。(Bubble Sort is a simple sorting algorithm. It repeatedly visits the sequence of items to be sorted, compares two elements at a time, and switches them over if their order is wrong. The work of visiting the sequence is repeated until there is no need to swap, which means that the sequence has been sorted.)
Date : 2026-01-15 Size : 35kb User : JinPatrick

« 12 3 4 5 6 7 8 9 10 ... 50 »