Location:
Search - bubblesort
Search list
Description: 一个起泡排序算法-a bubble sort algorithms
Platform: |
Size: 1024 |
Author: 李春 |
Hits:
Description: 这是一个图形演示的排序程序，有可供选择的常见的如，快速，等几种排序方法。也可设置时间来控制排序的速度。-This is a graphic demonstration of sequencing procedures, alternatives such as common, rapid and several other ranking methods. Time also can be set to control the speed of sequencing.
Platform: |
Size: 8192 |
Author: 刘卫 |
Hits:
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:
Description: 实现排序算法中的冒泡排序过程 并在最坏和平均状况下加以对比-Realize the bubble sort algorithm to sort the process and in the worst and average conditions to be compared
Platform: |
Size: 82944 |
Author: summer |
Hits:
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:
Description: 本程序可以实现在窗口中的冒泡算法，并且具有任意性-This procedure can be achieved in the bubble window algorithm, and an arbitrary character
Platform: |
Size: 1946624 |
Author: 干能强 |
Hits:
Description: 使用冒泡排序方法和C++函数模板 是学习的好例子-Methods and the use of Bubble Sort C++ Function template is a good example of learning
Platform: |
Size: 223232 |
Author: 王鑫 |
Hits:
Description: 冒泡排序，以及测试程序，类似的还有其他排序，可以进行比较-Bubble Sort, and testing procedures, there are other sort of similar, you can compare
Platform: |
Size: 4096 |
Author: 王森 |
Hits:
Description: 常用的数据结构--Java实现的源代码，主要是冒泡排序算法的实现。-Commonly used data structure- Java source code to achieve, mainly Bubble Sort algorithm.
Platform: |
Size: 2048 |
Author: shengang |
Hits:
Description: 本文件包括了各种常用排序算法
void InsertSort(SqList L) //直接插入排序
void BInsertSort(SqList L) //折半插入排序
void BubbleSort(SqList L) //冒泡排序
void QuickSort(SqList L) //快速排序
void ShellSort(SqList L) //希尔排序-This document includes a variety of commonly used sorting algorithm void InsertSort (SqList L)// direct insertion sort void BInsertSort (SqList L)// half insertion sort void BubbleSort (SqList L)// Bubble Sort void QuickSort (SqList L)// quicksort void ShellSort (SqList L)// Hill sort
Platform: |
Size: 3072 |
Author: limeng |
Hits:
Description: Bubble Sorting using MPI libraries
Platform: |
Size: 1024 |
Author: Chitra |
Hits:
Description: 这是一个简单初级的for循环冒泡排序的程序，便于初学者查阅-Bubblesort，C++ programming
Platform: |
Size: 1024 |
Author: 施维 |
Hits:
Description: bubble sort java implementatioin
Platform: |
Size: 1024 |
Author: galtaash |
Hits:
Description: This simple code is made up of java, we did it last semester, it is the so called bubblesort.
Platform: |
Size: 1024 |
Author: brenda |
Hits:
Description: 冒泡法排序的应用程序，由小到大并将每一步排序的中间过程输出-bubblesort
Platform: |
Size: 45056 |
Author: 齐岩磊 |
Hits:
Description: 排序BubbleSort，对10个整型数据进行排序-Sort BubbleSort, on the sort of 10 integers
Platform: |
Size: 1024 |
Author: zxq |
Hits:
Description: public class BubbleSort{
static String printArray(int[] a){
String result=""
for(int i=0 i<a.length i++) result+=a[i]+" "
return result
}
static int[] bubbleSort(int[] a){
int t
for(int i=0 i<a.length i++)
{
for(int j=0 j<a.length-i-1 j++)
//升序排列用大于，降序排列用小于，此处为降序排列。
if(a[j]<a[j+1])
{t=a[j] a[j]=a[j+1] a[j+1]=t }
}
return a
}
public static void main(String args[])
{
int a[]={25,36,47,32,21,16}
System.out.println("排序前的数组\n"+printArray(a))
a=bubbleSort(a)
System.out.println("排序后的数组\n"+printArray(a))
}
} -public class BubbleSort{
static String printArray(int[] a){
String result=""
for(int i=0 i<a.length i++) result+=a[i]+" "
return result
}
static int[] bubbleSort(int[] a){
int t
for(int i=0 i<a.length i++)
{
for(int j=0 j<a.length-i-1 j++)
//升序排列用大于，降序排列用小于，此处为降序排列。
if(a[j]<a[j+1])
{t=a[j] a[j]=a[j+1] a[j+1]=t }
}
return a
}
public static void main(String args[])
{
int a[]={25,36,47,32,21,16}
System.out.println("排序前的数组\n"+printArray(a))
a=bubbleSort(a)
System.out.println("排序后的数组\n"+printArray(a))
}
}
Platform: |
Size: 3072 |
Author: jing |
Hits:
Description: 该演示程序描述了冒泡排序！！！改程序也有很多不足的地方如果有兴趣可以一起交流。 gzdxzhouyuqing@tom.com-The demonstration program described bubble sort! ! ! Reform process has many deficiencies are interested you can share together. gzdxzhouyuqing@tom.com
Platform: |
Size: 137216 |
Author: gzuzyq |
Hits:
Description: 我自己写的冒泡法对数组中的数据排序，通俗易懂。-bubblesort for array interge data.easy to read.
Platform: |
Size: 253952 |
Author: 斯蒂芬 |
Hits:
Description: c++ bubblesort()
Platform: |
Size: 7168 |
Author: reco
|
Hits: