java 100以内冒泡算法_Java 语言实现的直接插入、冒泡等几个经典排序算法

1.[代码][Java]代码

希尔排序：

public class shellSort {

public shellSort(){

int a[]={1,54,6,3,78,34,12,45,56,100};

double d1=a.length;

int temp=0;

while(true){

d1= Math.ceil(d1/2);

int d=(int) d1;

for(int x=0;x

for(int i=x+d;i

int j=i-d;

temp=a[i];

for(;j>=0&&temp

a[j+d]=a[j];

}

a[j+d]=temp;

}

}

if(d==1)

break;

}

for(int i=0;i

System.out.println(a[i]);

}

}

/******************************************************************/

简单选择排序:

public class selectSort {

public selectSort(){

int a[]={1,54,6,3,78,34,12,45};

int position=0;

for(int i=0;i

int j=i+1;

position=i;

int temp=a[i];

for(;j

if(a[j]

temp=a[j];

position=j;

}

}

a[position]=a[i];

a[i]=temp;

}

for(int i=0;i

System.out.println(a[i]);

}

}

/*****************************************************************/

堆排序 :

import java.util.Arrays;

public class HeapSort {

int a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};

public HeapSort(){

heapSort(a);

}

public void heapSort(int[] a){

System.out.println("开始排序");

int arrayLength=a.length;

//循环建堆

for(int i=0;i= 0;i--){

//k保存正在判断的节点

int k=i;

//如果当前k节点的子节点存在

while(k*2+1<=lastIndex){

//k节点的左子节点的索引

int biggerIndex=2*k+1;

//如果biggerIndex小于lastIndex，即biggerIndex+1代表的k节点的右子节点存在

if(biggerIndex < lastIndex){

//若果右子节点的值较大

if(data[biggerIndex] < data[biggerIndex+1]){

//biggerIndex总是记录较大子节点的索引

biggerIndex++;

}

}

//如果k节点的值小于其较大的子节点的值

if(data[k] < data[biggerIndex]){

//交换他们

swap(data,k,biggerIndex);

//将biggerIndex赋予k，开始while循环的下一次循环，重新保证k节点的值大于其左右子节点的值

k=biggerIndex;

}else{

break;

}

}

}

}

}

/**************************************************************************/

冒泡排序:

public class bubbleSort {

public bubbleSort(){

int a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};

int temp=0;

for(int i=0;i

for(int j=0;j

if(a[j]>a[j+1]){

temp=a[j];

a[j]=a[j+1];

a[j+1]=temp;

}

}

}

for(int i=0;i

System.out.println(a[i]);

}

}