Java 冒泡排序算法

上一篇 / 下一篇 2010-03-23 11:05:48 / 个人分类：开发技术

package com.zzp.test;

public class bubble {

public static void main(String[] args) {

int a[] = { 6, 7, 100, 5, 0, 8 };

for (int j = 0; j < a.length; j++) {

for (int i = 0; i < a.length - 1; i++) {

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

int k = 0;

k = a[i];

a[i] = a[i + 1];

a[i + 1] = k;

}

for (int l = 0; l < a.length; l++) {

System.out.print(a[l] + " ");

}

TAG: